Seventh International Conference on Application of Concurrency to System Design (ACSD 2007) Synthesis of Petri Nets from Finite Partial Languages Bratislava, Slovak Republic July 10-July 13 ISBN: 0-7695-2902-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ACSD.2007.72
In this paper we present an algorithm to synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial language). This p/t-net has minimal non-sequential behavior including the specified partial language. Consequently, either this net has exactly the non-sequential behavior specified by the partial language, or there is no such p/t-net. We finally develop an algorithm to test whether the synthesized net has exactly the non-sequential behavior specified by the partial language. The algorithms are based on the theory of regions for partial languages developed by Lorenz and Juh?as. Thus, this paper shows the applicability of this concept and, for the first time, provides an effective algorithm for the synthesis of system models from partial languages.
Citation:
Robert Lorenz, Robin Bergenthum, J?rg Desel, Sebastian Mauser, "Synthesis of Petri Nets from Finite Partial Languages," acsd, pp.157-166, Seventh International Conference on Application of Concurrency to System Design (ACSD 2007), 2007 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb