This paper presents an algorithm for the synthesis of bounded Petri nets from transition systems. A bounded Petri net is always provided in case it exists. Otherwise, the events ar...
Josep Carmona, Jordi Cortadella, Michael Kishinevs...
The paper presents an extensible Petri Net Markup Language (xPNML), which is an extended version of PNML. The xPNML format overcomes limitations associated with PNML structure for...
Abstract This paper introduces the notion of well-structured language. A wellstructured language can be defined by a labelled well-structured transition system, equipped with an u...
Abstract. We study the expressiveness of the join calculus by comparison with (generalised, coloured) Petri nets and using tools from type theory. More precisely, we consider four ...
In this paper, we revisit the forward and backward approaches to the verification of extensions of infinite state Petri Nets. As contributions, we propose an efficient data struct...