skip to main content
10.1145/2723839.2723840acmotherconferencesArticle/Chapter ViewAbstractPublication Pagess-bpmoneConference Proceedingsconference-collections
research-article

Abstract state machine nets: closing the gap between business process models and their implementation

Published:23 April 2015Publication History

ABSTRACT

The gap between on the one side the users' understanding of Business Process Models (BPMs) and on the other side the run behavior of model implementations is still with us. We introduce Abstract State Machine Nets (ASM Nets) whose component ASMs can be defined using a simple combination of textual (data-oriented) and intuitive graphical (control-flow oriented) yet semantically rigorously defined descriptive means. This allows the BP experts to design BPMs whose underlying ASM Nets constitute a reliable precise contract---a contract which guarantees the BP domain experts that the application-domain focussed understanding of the BPMs they design is also a correct understanding of the code behavior provided by the implementation of the models by software experts. This paves the way for the development of certifiably correct BPMs and their implementations. To illustrate one practical and one conceptual application of the concept we a) instantiate ASM Nets to model the behavioral meaning of the graphical and textual notations used in the commercial S-BPM tool suite with its focus on communication (service interaction) and b) show that applying the rigorous ASM refinement concept to ASM Nets supports IBM's Guard-Stage-Milestone approach to adaptive case management by an accurate conceptual foundation.

References

  1. UML 2.0 superstructure specification. Object Management Group, see http://www.omg.org/cgi-bin/doc?formal/05-07-04.Google ScholarGoogle Scholar
  2. Business Process Model and Notation (BPMN). Version 2.0. http://www.omg.org/spec/BPMN/2.0, January 2011. formal/2011-01-03.Google ScholarGoogle Scholar
  3. Case Management Model and Notation (CMMN). Version 1.0 Beta 1. http://www.omg.org/spec/CMMN/1.0/Beta1, January 2013.Google ScholarGoogle Scholar
  4. J.-R. Abrial. The B-Book. Cambridge University Press, Cambridge, 1996.Google ScholarGoogle Scholar
  5. J.-R. Abrial. Modeling in Event-B: System and Software Engineering. Cambridge University Press, Cambridge, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Altenhofen, E. Börger, A. Friesen, and J. Lemcke. A high-level specification for virtual providers. Int.J.BP Integration and Management, 1: 267--278, 2006.Google ScholarGoogle Scholar
  7. Web Services Business Process Execution Language version 2.0. OASIS Standard, 2007. URL http://docs.oasis-open.org/wsbpel/2.0/OS/wsbpel-v2.0-OS.html.Google ScholarGoogle Scholar
  8. E. Börger. High-level system design and analysis using Abstract State Machines. In D. Hutter et al., editors, Current Trends in Applied Formal Methods (FM-Trends 98), volume 1641 of LNCS, pages 1--43. Springer, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. Börger. The ASM ground model method as a foundation of requirements engineering. In N. Dershowitz, editor, Verification: Theory and Practice, volume 2772 of LNCS, pages 145--160. Springer, 2003.Google ScholarGoogle Scholar
  10. E. Börger. The ASM refinement method. Formal Aspects of Computing, 15: 237--257, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  11. E. Börger. Construction and analysis of ground models and their refinements as a foundation for validating computer based systems. Formal Aspects of Computing, 19: 225--241, 2007. Google ScholarGoogle ScholarCross RefCross Ref
  12. E. Börger. Approaches to modeling business processes. A critical analysis of BPMN, workflow patterns and YAWL. J. Software and Systems Modeling, 2011.Google ScholarGoogle Scholar
  13. E. Börger. The subject-oriented approach to software design and the Abstract State Machines method. volume 7260 of LNCS, pages 52--72, 2012. Reprinted in Vol. 104 of LN in Business Information Processing, pp. 1--21, Springer, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. E. Börger and K.-D. Schewe. Concurrent Abstract State Machines, June 2014. submitted.Google ScholarGoogle Scholar
  15. E. Börger and K.-D. Schewe. Specifying transaction control to serialize concurrent program executions. In Y. Ait-Ameur and K.-D. Schewe, editors, Proc. ABZ 2014, volume 8477 of LNCS, pages 142--157. Springer, 2014.Google ScholarGoogle Scholar
  16. E. Börger and R. F. Stärk. Abstract State Machines. A Method for High-Level System Design and Analysis. Springer, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. F. P. J. Brooks. No silver bullet. Computer, 20(4): 10--19, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. D. Cohn and R. Hull. Business artifacts: a data-centric approach to modeling business operations and processes. IEEE Data Engineering Bulletin, 32: 3--9, 2009.Google ScholarGoogle Scholar
  19. R. Farahbod et al. The CoreASM Project. http://www.coreasm.org.Google ScholarGoogle Scholar
  20. A. Fleischmann, W. Schmidt, C. Stary, S. Obermeier, and E. Börger. Subject-Oriented Business Process Management. Springer Open Access Book, Heidelberg, 2012. www.springer.com/978-3-642-32391-1. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. A. Fleischmann and C. Stary. Whom to talk to? A stakeholder perspective on business process development. Universal Access in the Information Society, pages 1--26, June 2011. DOI 10.1007/s10209-011-0236-x. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. W. Goerigk, A. Dold, T. Gaul, G. Goos, A. Heberle, F. W. von Henke, U. Hoffmann, H. Langmaack, H. Pfeifer, H. Ruess, and W. Zimmermann. Compiler correctness and implementation verification: The verifix approach. In P. Fritzson, editor, Int. Conf. on Compiler Construction, Proc. Poster Session of CC'96, Linköping, Sweden, 1996. IDA Technical Report LiTH-IDA-R-96-12.Google ScholarGoogle Scholar
  23. F. Heath et al. Barcelona: A design and runtime environment for declarative artifact-centric BPM. In ICSOC 2013, volume 8274 of LNCS, pages 705--709, 2013.Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. C. A. R. Hoare. The verifying compiler: A grand challenge for computing research. J. ACM, 50(1): 63--69, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. T. Hoare and J. Misra. Verified software: theories, tools, experiments. Vision of a Grand Challenge project. In B. Meyer, editor, Proc.IFIP WG Conference on Verified Software: Tools, Techniques, and Experiments, http://vstte.ethz.ch/papers.html, Zürich (Switzerland), October 2005. Chair of Software Engineering at ETH Zürich.Google ScholarGoogle Scholar
  26. R. Hull et al. Business artifacts with Guard-State-Milestone lifecycles: Managing artifact interactions with conditions and events. In 5th ACM Int.Conf. on Distributed Event-Based Systems (DEBS 2011). ACM, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. R. Hull et al. Introducing the Guard-State-Milestone approach for specifying business entity lifecycles. In M. Bravetti and T. Bultan, editors, Web Services and Formal Methods, volume 6551 of LNCS, pages 1--24. Springer, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. G. Klein and T. Nipkow. A machine-checked model for a Java-like language, virtual machine and compiler. ACM Transactions on Programming Languages and Systems, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. J. Kohlmeyer. Eine formale Semantik für die Verknüpfung von Verhaltensbeschreibungen in der UML 2. PhD thesis, Universität Ulm (Germany), 2009.Google ScholarGoogle Scholar
  30. J. Kohlmeyer and W. Guttmann. Unifying the semantics of UML 2 state, activity and interaction diagrams. LNCS, pages 206--217. Springer, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. L. Lamport and N. Lynch. Handbook of Theoretical Computer Science, chapter Distributed Computing: Models and Methods, pages 1157--1199. Elsevier, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. H. Lerchner and C. Stary. An open S-BPM runtime environment based on Abstract State Machines. In Proc.IEEE 16th Confererence on Business Informatics, pages 54--61, 2014. http://doi.ieeecomputersociety.org/10.1109/CBI.2014.24. See http://www.i2pm.net/interest-groups/open-s-bpm/sub-projects/open-s-bpm-workflow-engine. Google ScholarGoogle ScholarDigital LibraryDigital Library
  33. X. Leroy. Formal verification of a realistic compiler. Communications of the ACM, 52(7): 107--115, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  34. Metasonic. Metasonic-suite. www.metasonic.de/metasonic-suite.Google ScholarGoogle Scholar
  35. J. Recker and J. Mendling. On the translation between BPMN and BPEL: Conceptual mismatch between process modeling languages. In Proc.11th EMMSAD, June 2006.Google ScholarGoogle Scholar
  36. J. Recker and J. Mendling. Lost in business process model translations: How a structured approach helps to identify conceptual mismatch. In K. Siau, editor, Research Issues in Systems Analysis and Design, Databases and Software Development, pages 227--259. IGI Publishing, Hershey, Pennsylvania, 2007.Google ScholarGoogle Scholar
  37. S. Sarstedt. Semantic Foundation and Tool Support for Model-Driven Development with UML 2 Activity Diagrams. PhD thesis, Universität Ulm, 2006.Google ScholarGoogle Scholar
  38. S. Sarstedt and W. Guttmann. An ASM semantics of token flow in UML 2 activity diagrams. volume 4378 of LNCS, pages 349--362. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. G. Schellhorn. Verification of ASM refinements using generalized forward simulation. J. Universal Computer Science, 7(11): 952--979, 2001.Google ScholarGoogle Scholar
  40. G. Schellhorn. ASM refinement and generalizations of forward simulation in data refinement: A comparison. Theoretical Computer Science, 336(2-3): 403--436, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  41. G. Schellhorn. ASM refinement preserving invariants. J. UCS, 14(12), 2008.Google ScholarGoogle Scholar
  42. G. Schellhorn. Completeness of ASM refinement. Electr. Notes TCS, 214, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. G. Schellhorn. Completeness of fair ASM refinement. SCP, 76(9): 756--773, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. Semiconductor Industry Assoc. International technologoy roadmap for semiconductors. Design. http://www.itrs.net/Links/2005ITRS/Design2005.pdf, 2005.Google ScholarGoogle Scholar
  45. R. F. Stärk and J. Schmid. Completeness of a bytecode verifier and a certifying Java-to-JVM compiler. J. of Automated Reasoning, 30: 323--361, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  46. R. F. Stärk, J. Schmid, and E. Börger. Java and the Java Virtual Machine: Definition, Verification, Validation. Springer-Verlag, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  47. J. K. Strosnider, P. Nandi, S. Kumaran, S. Gosh, and A. Arsanjani. Model-driven synthesis of SOA solutions. IBM Syst.J., 41(5): 415--432, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  48. M. Weidlich, G. Decker, A. Grosskopf, and M. Weske. BPEL to BPMN: The myth of a straight-forward mapping. In On the Move to Meaningful Internet Systems: OTM 2008, Part I, volume 5331 of Springer LNCS, pages 265--282, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. N. Wirth. Program development by stepwise refinement. Comm. ACM, 14, 1971. Google ScholarGoogle ScholarDigital LibraryDigital Library
  50. YAWL: Yet Another Workflow Language. http://www.yawlfoundation.org/.Google ScholarGoogle Scholar
  51. M. zur Muehlen and J. Recker. How much BPMN do you need? Posted at http://www.bpm-research.com/2008/03/03/how-much-bpmn-do-you-need/.Google ScholarGoogle Scholar
  52. M. zur Muehlen and J. Recker. How much language is enough? Theoretical and practical use of the Business Process Modeling Notation. In Z. Bellahsène and M. Léonard, editors, Advanced Information Systems Engineering (CAiSE 2008), volume 5074 of LNCS, pages 465--479. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Abstract state machine nets: closing the gap between business process models and their implementation

        Recommendations

        Reviews

        Christoph F. Strnadl

        Process automation has seen many unsuccessful attempts to bridge the gap between requirements specification by domain experts and technical implementation by software developers. This so-called ground model problem is a direct result of the (in general) imprecise, inconsistent, or incorrect process models that only partially or erroneously cover the requirements of the to-be-implemented software artifacts. Even though the paper provides an interesting approach to this problem, it is unfortunately not convincing. The authors introduce abstract state machines (ASMs) as basic constructs for modeling the flow of activities in a process. An ASM consists of one or more inputs (entries, described by entry conditions), a body where the actual computation of a process step happens, and one or more outputs (exits, described by exit conditions). Larger processes are created by linking exit conditions of one ASM with the entry conditions of another ASM. By preserving entry and exit conditions, one may also hierarchically refine the body of an ASM into more complex flows. The paper also shows (in really great length) that this is sufficient to model the subject-oriented approach to business process management (S-BPM) and, most probably, the case management model and notation (CMMN) standard currently in development. Additionally, the authors also address how to demonstrate (requirements) model correctness, completeness, and consistency within this approach. A really enlightening epistemological introduction highlights the need to provide a full model, not only covering process flow, but also including data, resources, and other environmental conditions (for example, security, authentication, and user interfaces) to solve the ground model problem. Sadly, however, the paper falls into the very same trap it has (rightfully) identified as the root cause for the current (deplorable) state of affairs; like many other unsuccessful attempts, it only focuses on modeling the flow logic of a business process. Therefore, I recommend ignoring this approach for the moment, unless you are interested in ASMs or S-BPM in particular, and wait for future refinements of this approach (or others) to close the business/information technology (IT) divide. Online Computing Reviews Service

        Access critical reviews of Computing literature here

        Become a reviewer for Computing Reviews.

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Other conferences
          S-BPM ONE '15: Proceedings of the 7th International Conference on Subject-Oriented Business Process Management
          April 2015
          182 pages
          ISBN:9781450333122
          DOI:10.1145/2723839

          Copyright © 2015 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 23 April 2015

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate28of54submissions,52%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader