Free choice Petri nets
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Coloured Petri nets (2nd ed.): basic concepts, analysis methods and practical use: volume 1
Business Process Engineering: Reference Models for Industrial Enterprises
Business Process Engineering: Reference Models for Industrial Enterprises
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Ereignisgesteuerte Proze?ketten und Petri-Netze.
Ereignisgesteuerte Proze?ketten und Petri-Netze.
An Ontological Analysis of Integrated Process Modelling
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
Colored petri nets to verify extended event-driven process chains
OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Verification of EPCs: using reduction rules and petri nets
CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
On the semantics of EPCs: efficient calculation and simulation
BPM'05 Proceedings of the 3rd international conference on Business Process Management
Comparing the control-flow of EPC and petri net from the end-user perspective
BPM'05 Proceedings of the 3rd international conference on Business Process Management
On the syntax of reference model configuration – transforming the C-EPC into lawful EPC models
BPM'05 Proceedings of the Third international conference on Business Process Management
| Hi-index | 0.00 |
One of the widespread methods for modeling business processes is the method of event-driven process chains (EPCs) (Ereignisgesteuerte Prozesskette [EPK]). The paper shows that EPCs can be translated into a simple class of colored Petri nets, which have a single color of type Boole and formulas from propositional logic as guards. The structure of the resulting Boolean net is a tree of bipolar synchronization (bp) graphs. This property simplifies considerably the behavioral analysis of EPCs, because Genrich and Thiagarajan proved, that well-formedness of bp schemes can be tested by a reduction algorithm. If the Boolean net resulting from the translation of an EPC is well-formed, it can be eventually translated into a free-choice net showing the same behavior. Therefore the translation of EPCs into Boolean Petri nets fixes the semantics of EPCs and allows a formal analysis of the EPC-method. In the domain of business process engineering only those EPCs, which have been certified as well-formed, can be recommended for further steps like simulation, activity based cost analysis or workflow.