Publication

A Symbolic Algorithm for the Synthesis of Bounded Petri Nets (2008)

Author(s): Carmona J; Cortadella J; Kishinevsky M; Kondratyev A; Lavagno L; Yakovlev A

    Abstract: 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.

      • Date: 23-27 June 2008
      • Conference Name: Applications and Theory of Petri Nets. Proceedings of the 29th International Conference
      • Volume: 5062
      • Pages: 92-111
      • Publisher: Springer Berlin
      • Publication type: Conference Proceedings (inc. abstract)
      • Bibliographic status: Published
      Staff

      Professor Alex Yakovlev
      Professor of Computer System Design