On the semantics of EPCs: efficient calculation and simulation

Authors:
Nicolas Cuntz;Ekkart Kindler
Affiliations:
Computer Graphics and Multimedia Systems Group, University of Siegen;Software Engineering Group, University of Paderborn
Venue:
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Year:
2005

Citing 2
Cited 1

Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Petri Net Based Certification of Event-Driven Process Chains

ICATPN '98 Proceedings of the 19th International Conference on Application and Theory of Petri Nets

Semantics of standard process models with OR-joins

OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, we have defined a formal semantics of Event driven Process Chains (EPCs) that, for the first time, faithfully captures the non-local behaviour of the XOR- and OR-join connectors. This fixed-point characterisation of the semantics of EPCs, however, does not provide an efficient algorithm for calculating the semantics of an EPC and for simulating it. In this paper, we will show how to calculate this semantics of an EPC in an efficient way by employing Kleene's fixed-point theorem and different techniques from symbolic model checking. These algorithms have been implemented in an open source tool for simulating and analysing EPCs: EPC Tools.