Sciweavers

Share
APN
2008
Springer

A Symbolic Algorithm for the Synthesis of Bounded Petri Nets

9 years 4 days ago
A Symbolic Algorithm for the Synthesis of Bounded Petri Nets
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 are split into several transitions to guarantee the synthesis of a Petri net with bisimilar behavior. The algorithm uses symbolic representations of multisets of states to efficiently generate all the minimal regions. The algorithm has been implemented in a tool. Experimental results show a significant net reduction when compared with approaches for the synthesis of safe Petri nets.
Josep Carmona, Jordi Cortadella, Michael Kishinevs
Added 12 Oct 2010
Updated 12 Oct 2010
Type Conference
Year 2008
Where APN
Authors Josep Carmona, Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Alexandre Yakovlev
Comments (0)
books