Formalization and verification of event-driven process chains

Abstract For many companies, business processes have become the focal point of attention. As a result, many tools have been developed for business process engineering and the actual deployment of business processes. Typical examples of these tools are Business Process Reengineering (BPR) tools, Enterprise Resource Planning (ERP) systems, and Workflow Management (WFM) systems. Some of the leading products, e.g. SAP R/3 (ERP/WFM) and ARIS (BPR), use Event-driven Process Chains (EPCs) to model business processes. Although the EPCs have become a widespread process modeling technique, they suffer from a serious drawback: neither the syntax nor the semantics of an EPC are well defined. In this paper, this problem is tackled by mapping EPCs (without connectors of type ∨) onto Petri nets. The Petri nets have formal semantics and provide an abundance of analysis techniques. As a result, the approach presented in this paper gives formal semantics to EPCs. Moreover, many analysis techniques are available for EPCs. To illustrate the approach, it is shown that the correctness of an EPC can be checked in polynomial time by using Petri-net-based analysis techniques.

[1]  Christoph Bussler,et al.  Workflow Management: Modeling Concepts, Architecture and Implementation , 1996 .

[2]  Wolfgang Reisig,et al.  Application and Theory of Petri Nets , 1982, Informatik-Fachberichte.

[3]  Ekkart Kindler,et al.  Liveness, Fairness, and Recurrence in Petri Nets , 1999, Inf. Process. Lett..

[4]  Wil M. P. van der Aalst,et al.  Verification of Workflow Nets , 1997, ICATPN.

[5]  Vaj Tijn Borghuis Priorean tense logics in modal pure type systems , 1996 .

[6]  Lmg Loe Feijs Algebraic specification and simulation of lazy functional programs in a concurrent environment , 1996 .

[7]  August-Wilhelm Scheer Business Process Engineering, ARIS-Navigator for Reference Models for Industrial Enterprises , 1994 .

[8]  W.M.P. van der Aalst,et al.  Parallel computation of reachable dead states in a free-choice Petri net , 1996 .

[9]  M. Nüttgens,et al.  Geschäftsprozeßmodellierung mit der objektorientierten Ereignisgesteuerten Prozeßkette (oEPK) , 1998 .

[10]  W.M.P. van der Aalst,et al.  Structural characterizations of sound workflow nets , 1996 .

[11]  Kees M. van Hee,et al.  Workflow Management: Modellen, Methoden en Systemen (in Dutch) , 1997 .

[12]  P.D.V. van der Stok,et al.  Real-time distributed concurrency control algorithms with mixed time constraints , 1996 .

[13]  Jan A. Bergstra,et al.  Discrete Time Process Algebra: Absolute Time, Relative Time and Parametric Time , 1997, Fundam. Informaticae.

[14]  Gjpm Geert-Jan Houben,et al.  Designing effective workflow management processes , 1996 .

[15]  Wil M.P. van der Aalst,et al.  Three good reasons for using a Petri-net-based workflow management system , 1996 .

[16]  van der Wmp Wil Aalst,et al.  A Petri-net-based Tool to analyze workflows , 1997 .

[17]  Christoph Schneider,et al.  Petri Net Based Certification of Event-Driven Process Chains , 1998, ICATPN.

[18]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[19]  Wil M. P. van der Aalst,et al.  Life-Cycle Inheritance: A Petri-Net-Based Approach , 1997, ICATPN.

[20]  J. Davenport Editor , 1960 .

[21]  Roland Carl Backhouse,et al.  Deriving a systolic regular language recognizer , 1997, Algorithmic Languages and Calculi.

[22]  Rüdiger Valk Infinite Behaiour and Fairness , 1986, Advances in Petri Nets.

[23]  Grzegorz Rozenberg,et al.  Dynamic change within workflow systems , 1995, COCS '95.

[24]  Twan Basten,et al.  A process-algebraic approach to life-cycle inheritance : inheritance = encapsulation + abstraction , 1996 .

[25]  M. Voorhoeve Structural Petri net equivalence , 1996 .

[26]  Atm Ad Aerts,et al.  Multi-user publishing in the Web: DReSS, a Document Repository Service Station , 1996 .

[27]  Fairouz Kamareddine,et al.  A correspondence between Nuprl and the Ramified Theory of Types , 1996 .

[28]  Jjm Jozef Hooman,et al.  A programming-language extension for distributed real-time systems , 1997 .

[29]  van der Wmp Wil Aalst,et al.  Conservative adaption of workflow , 1996, PAKM.

[30]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[31]  Martin Large,et al.  Using search conferences for building learning, planning and implementing communities that work , 1997 .

[32]  Wolfgang Reisig Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[33]  R. T. Gerth,et al.  A discretisation method for asynchronous timed systems , 1997 .

[34]  Rp Rob Nederpelt,et al.  Predicate calculus : concepts and misconceptions , 1996 .

[35]  A. T. M. Aerts,et al.  OODB Support for WWW Applications: Disclosing the internal structure of Hyperdocuments , 1996, WebNet.

[36]  Clarence A. Ellis,et al.  Modeling and Enactment of Workflow Systems , 1993, Application and Theory of Petri Nets.

[37]  Jcm Jos Baeten,et al.  Discrete-time process algebra with empty process , 1997 .

[38]  W. Brauer,et al.  Advances in Petri nets 1986, part I on Petri nets: central models and their properties , 1987 .

[39]  Michel A. Reniers,et al.  Static semantics of message sequence charts , 1996 .

[40]  Reniers,et al.  Completeness in discrete-time process algebra , 1996 .

[41]  Jose Antonio Hernandez,et al.  The Sap R/3 Handbook , 1997 .

[42]  Hans Weigand,et al.  A formal specification of deadlines using dynamic deontic logic , 1996 .

[43]  A. Scheer Business Process Engineering: Reference Models for Industrial Enterprises , 1994 .

[44]  Rüdiger Valk,et al.  Infinite Behaviour and Fairness , 1986 .

[45]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[46]  August-Wilhelm Scheer,et al.  Business Process Engineering , 1989 .