Processes of Place/Transition-Nets
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Deriving Unbounded Petri Nets from Formal Languages
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Synthesis of Petri Nets from Finite Partial Languages
ACSD '07 Proceedings of the Seventh International Conference on Application of Concurrency to System Design
Synthesis of Petri Nets from Scenarios with VipTool
PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Region based synthesis of P/T-nets and its potential applications
ICATPN'00 Proceedings of the 21st international conference on Application and theory of petri nets
Reducing k-safe Petri nets to pomset-equivalent 1-safe Petri nets
ICATPN'00 Proceedings of the 21st international conference on Application 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
Can i execute my scenario in your net? viptool tells you!
ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Can i execute my scenario in your net?
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
Unifying Petri Net Semantics with Token Flows
PETRI NETS '09 Proceedings of the 30th International Conference on Applications and Theory of Petri Nets
Hi-index | 0.00 |
In [LJ06] Lorenz and Juhás raised the question of whether there exists a suitable formalism for the representation of infinite families of partial orders generated by Petri nets. Restricting ourselves to bounded p /t -nets, we propose Hasse diagram generators as an answer. We show that Hasse diagram generators are expressive enough to represent the partial order language of any bounded p /t net. We prove as well that it is decidable both whether the (possible infinite) family of partial orders represented by a given Hasse diagram generator is included on the partial order language of a given p /t -net and whether their intersection is empty. Based on this decidability result, we prove that the partial order languages of two given Petri nets can be effectively compared with respect to inclusion. Finally we address the synthesis of k -safe p /t -nets from Hasse diagram generators.