Free-Choice Nets With Home Clusters Are Lucent

06/07/2021
by   Wil M. P. van der Aalst, et al.
0

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. Characterizing the class of systems that are lucent is a foundational and also challenging question. However, little research has been done on the topic. In this paper, it is shown that all free-choice nets having a home cluster are lucent. These nets have a so-called home marking such that it is always possible to reach this marking again. Such a home marking can serve as a regeneration point or as an end-point. The result is highly relevant because in many applications, we want the system to be lucent and many well-behaved process models fall into the class identified in this paper. Unlike previous work, we do not require the marked Petri net to be live and strongly connected. Most of the analysis techniques for free-choice nets are tailored towards well-formed nets. The approach presented in this paper provides a novel perspective enabling new analysis techniques for free-choice nets that do not need to be well-formed. Therefore, we can also model systems and processes that are terminating and/or have an initialization phase.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/12/2018

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 mar...
research
07/06/2022

Semilinear Home-space is Decidable for Petri Nets

A set of configurations 𝐇 is an home-space for a set of configurations 𝐗...
research
06/17/2023

Sleptsov Nets are Turing-complete

The present paper proves that a Sleptsov net (SN) is Turing-complete, th...
research
11/20/2019

Synthesis of Reduced Asymmetric Choice Petri Nets

A Petri net is choice-free if any place has at most one transition in it...
research
09/21/2021

Perpetual Free-choice Petri nets are lucent – proof of a theorem of van der Aalst using CP-exhaustions

Van der Aalst's theorem is an important result for the analysis and synt...
research
06/11/2020

Petri Nets with Parameterised Data: Modelling and Verification (Extended Version)

During the last decade, various approaches have been put forward to inte...
research
05/11/2020

On the Petri Nets with a Single Shared Place and Beyond

Petri nets proved useful to describe various real-world systems, but man...

Please sign up or login with your details

Forgot password? Click here to reset