Sciweavers

Share
ACSD
2007
IEEE

Synthesis of Petri Nets from Finite Partial Languages

8 years 8 months ago
Synthesis of Petri Nets from Finite Partial Languages
In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial language). The synthesized p/t-net either has exactly the non-sequential behavior specified by the partial language, or there is no such p/t-net. The first algorithm is based on the theory of token flow regions for partial languages developed by Lorenz and Juh
Robert Lorenz, Robin Bergenthum, Jörg Desel,
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2007
Where ACSD
Authors Robert Lorenz, Robin Bergenthum, Jörg Desel, Sebastian Mauser
Comments (0)
books