Petri nets: an introduction
Extension and intension of actions
Concurrency and nets: advances in Petri nets
On the analysis and synthesis of free choice systems
APN 90 Proceedings on Advances in Petri nets 1990
Selected papers of the Second Workshop on Concurrency and compositionality
The synthesis problem of Petri nets
Acta Informatica
Deriving Petri Nets from Finite Transition Systems
IEEE Transactions on Computers
The Book of Traces
Concurrency, Modularity, and Synchronization
MFCS '89 Proceedings on Mathematical Foundations of Computer Science 1989
Synthesis of Nets with Inhibitor Arcs
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
Transition Systems of Elementary Net Systems with Inhibitor Arcs
ICATPN '97 Proceedings of the 18th International Conference on Application and Theory of Petri Nets
Boolean Algebra of Nets, their Synthesis and Analysis
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Synthesising Elementary Net Systems with Inhibitor Arcs from Step Transition Systems
Fundamenta Informaticae - Application of Concurrency to System Design
Place/Transition Petri net Evolutions: Recording Ways, Analysis and Synthesis
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
| Hi-index | 0.00 |
We investigate relations between transition graphs and net structures. Whereas for a given net structure there always exists a reachability graph, the inverse problem to find a net structure for a given transition graph is not solvable in general. We present sufficient and necessary conditions for several classes of transition graphs such as general, pseudo-bounded, bounded and elementary transition graphs, corresponding to general and (pseudo-)bounded P/T nets or C/E nets. We also give maximal and minimal solutions within an algebraic structure of net structures. The entire investigation is formulated in the framework of multiset theory.