When are two Workflows the Same?

In the area of workflow management, one is confronted with a large number of competing languages and the relations between them (e.g. relative expressiveness) are usually not clear. Moreover, even within the same language it is generally possible to express the same workflow in different ways, a feature known as variability. This paper aims at providing some of the formal groundwork for studying relative expressiveness and variability by defining notions of equivalence capturing different views on how workflow systems operate. Firstly, a notion of observational equivalence in the absence of silent steps is defined and related to classical bisimulation. Secondly, a number of equivalence notions in the presence of silent steps are defined. A distinction is made between the case where silent steps are visible (but not controllable) by the environment and the case where silent steps are not visible, i.e., there is an alternation between system events and environment interactions. It is shown that these notions of equivalence are different and do not coincide with classical notions of bisimulation with silent steps (e.g. weak and branching).

[1]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[2]  Wil M. P. van der Aalst,et al.  The Application of Petri Nets to Workflow Management , 1998, J. Circuits Syst. Comput..

[3]  Wil M. P. van der Aalst,et al.  Inheritance of workflows: an approach to tackling problems related to change , 2002 .

[4]  Wil M.P. van der Aalst,et al.  YAWL: yet another workflow language , 2005, Inf. Syst..

[5]  Andreas Wombacher,et al.  Finding Trading Partners to Establish Ad-hoc Business Processes , 2002, OTM.

[6]  R. V. Glabbeek The Linear Time - Branching Time Spectrum II: The Semantics of Sequential Systems with Silent Moves , 1993 .

[7]  C. A. R. Hoare,et al.  Specification-Oriented Semantics for Communicating Processes , 1983, ICALP.

[8]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[9]  Jan Verelst,et al.  Reuse-oriented workflow modelling with Petri nets , 1998 .

[10]  Joost Engelfriet,et al.  Determinacy - (Observation Equivalence = Trace Equivalence) , 1985, Theor. Comput. Sci..

[11]  Tony Andrews Business Process Execution Language for Web Services Version 1.1 , 2003 .

[12]  Jos C. M. Baeten,et al.  Process Algebra , 2007, Handbook of Dynamic System Modeling.

[13]  Wil M. P. van der Aalst,et al.  Workflow Patterns , 2004, Distributed and Parallel Databases.

[14]  Twan Basten,et al.  Branching Bisimilarity is an Equivalence Indeed! , 1996, Inf. Process. Lett..

[15]  Jan Mendling,et al.  Business Process Execution Language for Web Services , 2006, EMISA Forum.

[16]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[17]  C. A. R. Hoare,et al.  Specification-oriented semantics for Communicating Processes , 1983, Acta Informatica.

[18]  Marc Voorhoeve,et al.  Process algebra with autonomous actions , 1996 .

[19]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[20]  Anna Ingólfsdóttir,et al.  Weak Semantics Based on Lighted Button Pressing Experiments , 1996, CSL.

[21]  Christoph Bussler,et al.  Workflow Management: Modeling Concepts, Architecture and Implementation , 1996 .

[22]  Wil M. P. van der Aalst,et al.  Fundamentals of control flow in workflows , 2003, Acta Informatica.