Abstract
The semantics of the OR-join in business process modeling languages like EPCs or YAWL have been discussed for a while. Still, the existing solutions suffer from at least one of two major problems. First, several formalizations depend upon restrictions of the EPC to a subset. Second, several approaches contradict the modeling intuition since the structuredness of the process does not guarantee soundness. In this paper, we present a novel semantical definition of EPCs that addresses these aspects yielding a formalization that is applicable for all EPCs and for which structuredness is a sufficient condition for soundness. Furthermore, we introduce a set of reduction rules for the verification of an EPC-specific soundness criterion and present a respective implementation. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Mendling, J., & Van Der Aalst, W. (2007). Formalization and verification of EPCs with OR-joins based on state and context. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4495 LNCS, pp. 439–453). Springer Verlag. https://doi.org/10.1007/978-3-540-72988-4_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
