On the Decomposition of Regional Events in Elementary Systems

We study the relation between labelled transition systems and the corresponding partial orders of regions. In particular, we focus on the sets of their potential events, or labels on the transitions, providing them with a structure so as to reason about concurrency from the perspective of the observable properties of these systems. This is achieved by introducing the notion of minimal events, as the generators of such a structure of labels. We show that these events are sufficient to synthesize a transition system, such that its Regional Partial Order is isomorphic to the one obtained with the full set of events.

[1]  Philippe Darondeau,et al.  Petri Net Synthesis , 2015, Texts in Theoretical Computer Science. An EATCS Series.

[2]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[3]  C. A. Petri Concepts of Net Theory , 1973, MFCS.

[4]  Sylvia Pulmannová,et al.  Orthomodular structures as quantum logics , 1991 .

[5]  Luca Bernardinello,et al.  On Stability of Regional Orthomodular Posets , 2017, ATAED@Petri Nets/ACSD.

[6]  Luca Bernardinello,et al.  Synthesis of Transition Systems from Quantum Logics , 2017, Fundam. Informaticae.

[7]  Philippe Darondeau,et al.  Transition systems without transitions , 2005, Theor. Comput. Sci..

[8]  Joost Engelfriet,et al.  Elementary Net Systems , 1996, Applications and Theory of Petri Nets.

[9]  Luca Bernardinello,et al.  An algebraic model of observable properties in distributed systems , 2003, Theor. Comput. Sci..

[10]  Andrzej Ehrenfeucht,et al.  Partial (set) 2-structures , 1990, Acta Informatica.

[11]  Luca Bernardinello,et al.  Synthesis of Net Systems , 1993, Application and Theory of Petri Nets.

[12]  J. Neumann,et al.  The Logic of Quantum Mechanics , 1936 .

[13]  Wolfgang Reisig,et al.  The synthesis problem of Petri nets , 1993, Acta Informatica.