Markings in Perpetual Free-Choice Nets Are Fully Characterized by Their Enabled Transitions

A marked Petri net is lucent if there are no two different reachable markings enabling the same set of transitions, i.e., states are fully characterized by the transitions they enable. This paper explores the class of marked Petri nets that are lucent and proves that perpetual marked free-choice nets are lucent. Perpetual free-choice nets are free-choice Petri nets that are live and bounded and have a home cluster, i.e., there is a cluster such that from any reachable state there is a reachable state marking the places of this cluster. A home cluster in a perpetual net serves as a "regeneration point" of the process, e.g., to start a new process instance (case, job, cycle, etc.). Many "well-behaved" process models fall into this class. For example, the class of short-circuited sound workflow nets is perpetual. Also, the class of processes satisfying the conditions of the {\alpha} algorithm for process discovery falls into this category. This paper shows that the states in a perpetual marked free-choice net are fully characterized by the transitions they enable, i.e., these process models are lucent. Having a one-to-one correspondence between the actions that can happen and the state of the process, is valuable in a variety of application domains. The full characterization of markings in terms of enabled transitions makes perpetual free-choice nets interesting for workflow analysis and process mining. In fact, we anticipate new verification, process discovery, and conformance checking techniques for the subclasses identified.

[1]  Wolfgang Reisig,et al.  Lectures on Petri Nets II: Applications , 1996, Lecture Notes in Computer Science.

[2]  Bruno Gaujal,et al.  Blocking a transition in a free choice net and what it tells about its throughput , 2003, J. Comput. Syst. Sci..

[3]  Eike Best,et al.  Structure Theory of Petri Nets: the Free Choice Hiatus , 1986, Advances in Petri Nets.

[4]  Tadao Murata,et al.  Petri nets: Properties, analysis and applications , 1989, Proc. IEEE.

[5]  Joachim Wehler.  Simplified proof of the blocking theorem for free-choice Petri nets , 2010, J. Comput. Syst. Sci..

[6]  Eike Best,et al.  Structure Theory of Petri Nets , 2013, Trans. Petri Nets Other Model. Concurr..

[7]  Boudewijn F. van Dongen,et al.  Replaying history on process models for conformance checking and performance analysis , 2012, WIREs Data Mining Knowl. Discov..

[8]  Wolfgang Reisig,et al.  Lectures on Petri Nets I: Basic Models , 1996, Lecture Notes in Computer Science.

[9]  Boudewijn F. van Dongen,et al.  Process mining: a two-step approach to balance between underfitting and overfitting , 2008, Software & Systems Modeling.

[10]  Wolfgang Reisig,et al.  Understanding Petri Nets Modeling Techniques, Analysis Methods, Case Studies , 2013, Bull. EATCS.

[11]  Wil M. P. van der Aalst,et al.  Modeling Business Processes - A Petri Net-Oriented Approach , 2011, Cooperative Information Systems series.

[12]  Wil M. P. van der Aalst,et al.  Workflow mining: discovering process models from event logs , 2004, IEEE Transactions on Knowledge and Data Engineering.

[13]  Wil M. P. van der Aalst.  Mediating between modeled and observed behavior: The quest for the “right” process: Keynote , 2013, IEEE 7th International Conference on Research Challenges in Information Science (RCIS).

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

[15]  P. S. Thiagarajan,et al.  A Fresh Look at Free Choice Nets , 1984, Inf. Control..

[16]  Jörg Desel,et al.  Traps Characterize Home States in Free Choice Systems , 1992, Theor. Comput. Sci..

[17]  Wil M. P. van der Aalst,et al.  Workflow Patterns: The Definitive Guide , 2016 .

[18]  Manuel Silva Suárez,et al.  Circuits, handles, bridges and nets , 1991, Applications and Theory of Petri Nets.

[19]  Jörg Desel,et al.  Free choice Petri nets , 1995 .

[20]  Moe Thandar Wynn,et al.  Soundness of workflow nets: classification, decidability, and analysis , 2011, Formal Aspects of Computing.

[21]  Javier Esparza.  Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete , 1998, Theor. Comput. Sci..

[22]  P. S. Thiagarajan,et al.  A Theory of Bipolar Synchronization Schemes , 1984, Theor. Comput. Sci..

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

[24]  Wil M. P. van der Aalst,et al.  Workflow Verification: Finding Control-Flow Errors Using Petri-Net-Based Techniques , 2000, Business Process Management.

[25]  C. Humby,et al.  Process Mining: Data science in Action , 2014 .