Theory of linear and integer programming
Theory of linear and integer programming
Modeling concurrency with partial orders
International Journal of Parallel Programming
Sequential and concurrent behaviour in Petri net theory
Theoretical Computer Science
On the interrelation between synchronized and non-synchronized behaviour of Petri Nets
Journal of Information Processing and Cybernetics
The equational theory of pomsets
Theoretical Computer Science
Information and Computation
Processes of Place/Transition-Nets
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Partial words versus processes: a short comparison
Advances in Petri Nets 1992, The DEMON Project
Unifying Petri Nets, Advances in Petri Nets
Faster Unfolding of General Petri Nets Based on Token Flows
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Synthesis of Petri Nets from Finite Partial Languages
Fundamenta Informaticae - Application of Concurrency to System Design, the Sixth Special Issue
Executability of scenarios in Petri nets
Theoretical Computer Science
Hasse Diagram Generators and Petri Nets
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Towards synthesis of petri nets from scenarios
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Can i execute my scenario in your net?
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Hi-index | 0.00 |
In this paper we advocate a unifying technique for description of Petri net semantics. Semantics, i.e. a possible behaviour, is basically a set of node-labelled and arc-labelled directed acyclic graphs, called token flows, where the graphs are distinguished up to isomorphism. The nodes of a token flow represent occurrences of transitions of the underlying net, so they are labelled by transitions. Arcs are labelled by multisets of places. Namelly, an arc between an occurrence x of a transition a and an occurrence y of a transition b is labelled by a multiset of places, saying how many tokens produced by the occurrence x of the transition a is consumed by the occurrence y of the transition b . The variants of Petri net behaviour are given by different interpretation of arcs and different structure of token flows, resulting in different sets of labelled directed acyclic graphs accepted by the net. We show that the most prominent semantics of Petri nets, namely processes of Goltz and Reisig, partial languages of Petri nets introduced by Grabowski, rewriting terms of Meseguer and Montanari, step sequences as well as classical occurrence (firing) sequences correspond to different subsets of token flows. Finally, we discuss several results achieved using token flows during the last four years, including polynomial test for the acceptance of a partial word by a Petri net, synthesis of Petri nets from partial languages and token flow unfolding.