Advanced Information Systems Engineering

Volume 4495 of the series Lecture Notes in Computer Science pp 439-453

Formalization and Verification of EPCs with OR-Joins Based on State and Context

  • Jan MendlingAffiliated withVienna University of Economics and Business Administration, Augasse 2-6, 1090 Vienna
  • , Wil van der AalstAffiliated withEindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven

* Final gross prices may vary according to local VAT.

Get Access


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.