Department of Information Technology

Hasse diagram Generators and Petri Nets


Mateus de Oliveira Oliveira

Date and Time

Thursday, March 3rd, 2010 at 10:30


Polacksbacken, room 1245


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 (possibly infinite) family of partial orders represented by a given Hasse diagram generator is included in 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.


Partial Oder Semantics of Concurrency, Petri Nets

Back to the seminar page

Updated  2011-02-23 11:49:51 by Frédéric Haziza.