A symbolic algorithm for the synthesis of bounded Petri nets
Document typeConference report
Rights accessOpen Access
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.
CitationCarmona, J. [et al.]. A symbolic algorithm for the synthesis of bounded Petri nets. A: International Conference on Applications and Theory of Petri Nets. "Applications and Theory of Petri Nets: 29th International Conference, PETRI NETS 2008, Xi’an, China, June 23-27, 2008: proceedings". Springer, 2008, p. 92-111.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder