Skip to main content
SpringerLink
Log in

Isotactics as a Foundation for Alignment and Abstraction of Behavioral Models

  • Conference paper
Book cover Business Process Management (BPM 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7481))

Included in the following conference series:

Abstract

There are many use cases in business process management that require the comparison of behavioral models. For instance, verifying equivalence is the basis for assessing whether a technical workflow correctly implements a business process, or whether a process realization conforms to a reference process. This paper proposes an equivalence relation for models that describe behaviors based on the concurrency semantics of net theory and for which an alignment relation has been defined. This equivalence, called isotactics, preserves the level of concurrency of aligned operations. Furthermore, we elaborate on the conditions under which an alignment relation can be classified as an abstraction. Finally, we show that alignment relations induced by structural refinements of behavioral models are indeed behavioral abstractions.

This work was initiated while the first author was with Hasso Plattner Institute.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. OMG: Business Process Model and Notation (BPMN), Version 2.0 (January 2011)

    Google Scholar 

  2. van der Aalst, W.M.P.: Inheritance of Business Processes: A Journey Visiting Four Notorious Problems. In: Ehrig, H., Reisig, W., Rozenberg, G., Weber, H. (eds.) Petri Net Technology for Communication-Based Systems. LNCS, vol. 2472, pp. 383–408. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  3. Polyvyanyy, A., Smirnov, S., Weske, M.: Business Process Model Abstraction. In: Handbook on Business Process Management 1, pp. 149–166. Springer (2010)

    Google Scholar 

  4. Nielsen, M., Plotkin, G.D., Winskel, G.: Petri nets, event structures and domains, Part I. Theoretical Computer Science (TCS) 13, 85–108 (1981)

    Article  MathSciNet  MATH  Google Scholar 

  5. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Heidelberg (1980)

    Book  Google Scholar 

  6. Park, D.: Concurrency and Automata on Infinite Sequences. In: Deussen, P. (ed.) GI-TCS 1981. LNCS, vol. 104, pp. 167–183. Springer, Heidelberg (1981)

    Chapter  Google Scholar 

  7. Liu, D.R., Shen, M.: Workflow modeling for virtual processes: An order-preserving process-view approach. Information Systems (IS) 28(6), 505–532 (2003)

    Article  MATH  Google Scholar 

  8. Polyvyanyy, A., Smirnov, S., Weske, M.: The Triconnected Abstraction of Process Models. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 229–244. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Dijkman, R.M., Dumas, M., García-Bañuelos, L., Käärik, R.: Aligning business process models. In: EDOC, pp. 45–53. IEEE CS (2009)

    Google Scholar 

  10. Weidlich, M., Dijkman, R., Mendling, J.: The ICoP Framework: Identification of Correspondences between Process Models. In: Pernici, B. (ed.) CAiSE 2010. LNCS, vol. 6051, pp. 483–498. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Lohmann, N., Verbeek, E., Dijkman, R.: Petri Net Transformations for Business Processes – A Survey. In: Jensen, K., van der Aalst, W.M.P. (eds.) ToPNoc II. LNCS, vol. 5460, pp. 46–63. Springer, Heidelberg (2009)

    Google Scholar 

  12. Goltz, U., Reisig, W.: The non-sequential behavior of Petri nets. Information and Control 57(2/3), 125–147 (1983)

    Article  MathSciNet  MATH  Google Scholar 

  13. Petri, C.A.: Non-Sequential Processes. GMD ISF. Gesellschaft für Mathematik und Datenverarbeitung (1977)

    Google Scholar 

  14. Rahm, E., Bernstein, P.A.: A survey of approaches to automatic schema matching. VLDB J. 10(4), 334–350 (2001)

    Article  MATH  Google Scholar 

  15. Euzenat, J., Shvaiko, P.: Ontology matching. Springer, Heidelberg (2007)

    MATH  Google Scholar 

  16. Noy, N.F., Klein, M.C.A.: Ontology evolution: Not the same as schema evolution. Knowl. Inf. Syst. 6(4), 428–440 (2004)

    Article  Google Scholar 

  17. Rull, G., Farré, C., Teniente, E., Urpí, T.: Validation of mappings between schemas. Data Knowl. Eng. 66(3), 414–437 (2008)

    Article  Google Scholar 

  18. Best, E., Devillers, R.R., Kiehn, A., Pomello, L.: Concurrent bisimulations in Petri nets. Acta Informatica (ACTA) 28(3), 231–264 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  19. Kühne, T.: Matters of (meta-)modeling. Softw. and Syst. Mod. 5(4), 369–385 (2006)

    Article  Google Scholar 

  20. Holschke, O., Rake, J., Levina, O.: Granularity as a Cognitive Factor in the Effectiveness of Business Process Model Reuse. In: Dayal, U., Eder, J., Koehler, J., Reijers, H.A. (eds.) BPM 2009. LNCS, vol. 5701, pp. 245–260. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  21. van der Aalst, W.M.P.: The application of Petri nets to workflow management. Journal of Circuits, Systems, and Computers (JCSC) 8(1), 21–66 (1998)

    Article  Google Scholar 

  22. Polyvyanyy, A., Vanhatalo, J., Völzer, H.: Simplified Computation and Generalization of the Refined Process Structure Tree. In: Bravetti, M., Buttan, T. (eds.) WS-FM 2010. LNCS, vol. 6551, pp. 25–41. Springer, Heidelberg (2011)

    Google Scholar 

  23. Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE 77(4), 541–580 (1989)

    Article  Google Scholar 

  24. van Glabbeek, R.J.: The Linear Time-Branching Time Spectrum (Extended Abstract). In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278–297. Springer, Heidelberg (1990)

    Google Scholar 

  25. van Glabbeek, R.J.: The Linear Time - Branching Time Spectrum II. In: Best, E. (ed.) CONCUR 1993. LNCS, vol. 715, pp. 66–81. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  26. van Glabbeek, R.J., Weijland, W.P.: Branching time and abstraction in bisimulation semantics. J. ACM 43(3), 555–600 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  27. Hidders, J., Dumas, M., van der Aalst, W.M.P., ter Hofstede, A.H.M., Verelst, J.: When are two workflows the same? In: CATS. CRPIT, vol. 41, pp. 3–11 (2005)

    Google Scholar 

  28. Pomello, L., Rozenberg, G., Simone, C.: A Survey of Equivalence Notions for Net Based Systems. In: Rozenberg, G. (ed.) APN 1992. LNCS, vol. 609, pp. 410–472. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  29. Weidlich, M., Dijkman, R., Weske, M.: Deciding Behaviour Compatibility of Complex Correspondences between Process Models. In: Hull, R., Mendling, J., Tai, S. (eds.) BPM 2010. LNCS, vol. 6336, pp. 78–94. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  30. Weidlich, M., Dijkman, R.M., Weske, M.: Behaviour equivalence and compatibility of business process models with complex correspondences. The Computer Journal (CJ) (in press, 2012)

    Google Scholar 

  31. Basten, T., van der Aalst, W.M.P.: Inheritance of behavior. J. Log. Algebr. Program. 47(2), 47–145 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  32. Polyvyanyy, A., Smirnov, S., Weske, M.: Process model abstraction: A slider approach. In: EDOC, pp. 325–331. IEEE CS (2008)

    Google Scholar 

  33. Berthelot, G.: Checking Properties of Nets Using Transformation. In: Rozenberg, G. (ed.) APN 1985. LNCS, vol. 222, pp. 19–40. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  34. Desel, J., Esparza, J.: Free Choice Petri Nets. Cambridge University Press (1995)

    Google Scholar 

  35. Brauer, W., Gold, R., Vogler, W.: A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol. 483, pp. 1–46. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Queensland University of Technology, Brisbane, Australia

    Artem Polyvyanyy

  2. Technion - Israel Institute of Technology, Haifa, Israel

    Matthias Weidlich

  3. Hasso Plattner Institute at the University of Potsdam, Potsdam, Germany

    Mathias Weske

Authors
  1. Artem Polyvyanyy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Matthias Weidlich
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mathias Weske
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Technology, Information Systems Discipline, Business Process Management Group, Queensland University of Technology, Level 5, 126 Margaret Street, 4000, Brisbane, QLD, Australia

    Alistair Barros

  2. Faculty of Industrial Engineering and Management, Technion - Israel Institute of Technology, 32000, Technion City, Haifa, Israel

    Avigdor Gal

  3. Informatics and Mathematical Modelling, Technical University of Denmark, Richard Petersens Plads, 2800, Kgs. Lynbgy, Denmark

    Ekkart Kindler

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Polyvyanyy, A., Weidlich, M., Weske, M. (2012). Isotactics as a Foundation for Alignment and Abstraction of Behavioral Models. In: Barros, A., Gal, A., Kindler, E. (eds) Business Process Management. BPM 2012. Lecture Notes in Computer Science, vol 7481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32885-5_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32885-5_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32884-8

  • Online ISBN: 978-3-642-32885-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation