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.

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.

URIhttp://hdl.handle.net/2117/130963

DOI10.1007/978-3-540-68746-7_10

ISBN978-3-540-68746-7

Publisher versionhttps://link.springer.com/chapter/10.1007/978-3-540-68746-7_10

Collections

View Usage Statistics

Show full item record

Files	Description	Size	Format	View
A_symbolic_algorithm_for_the_synthesis_o.pdf		344,6Kb	PDF	View/Open

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

UPCommons. Global access to UPC knowledge

A symbolic algorithm for the synthesis of bounded Petri nets

View/Open

Browse