Browse by author
Lookup NU author(s): Professor Alex Yakovlev
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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. © 2008 Springer-Verlag Berlin Heidelberg.
Author(s): Carmona J, Cortadella J, Kishinevsky M, Kondratyev A, Lavagno L, Yakovlev A
Editor(s): van Hee, KM; Valk, R
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Applications and Theory of Petri Nets: 29th International Conference
Year of Conference: 2008
Pages: 92-111
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Publisher: Springer
URL: http://dx.doi.org/10.1007/978-3-540-68746-7_10
DOI: 10.1007/978-3-540-68746-7_10
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science
ISBN: 9783540687450
