Formalization and verification of EPCs with OR-joins based on state and context

  • Authors:
  • Jan Mendling;Wil Van Der Aalst

  • Affiliations:
  • Vienna University of Economics and Business Administration, Vienna, Austria;Eindhoven University of Technology, Eindhoven, The Netherlands

  • Venue:
  • CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.02

Visualization

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 EPCspecific soundness criterion and present a respective implementation.