Sciweavers

AWPN
2008

Synthesis of Petri Nets from Infinite Partial Languages with VipTool

13 years 10 months ago
Synthesis of Petri Nets from Infinite Partial Languages with VipTool
Abstract. In this paper we show an implementation of an algorithm to synthesize a place/transition Petri net (p/t-net) from a possibly infinite partial language, which is given by a term over a finite set of labelled partial orders (LPOs). The implementation is integrated as an extension of our Petri net toolset VipTool. The new extension comprises two plug-ins. The first plug-in offers editing features to specify term based partial languages. The specification of terms is graphically supported by a visualization similar to structograms as well as by a representation in the form of UML activity diagrams. The second new plug-in provides the algorithmic computation of a p/t-net synthesized from a term specification. This algorithm is in principle based on ideas already presented in the paper [4], but a so called separation computation is applied instead of the basis representation used in [4].
Robin Bergenthum, Sebastian Mauser
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2008
Where AWPN
Authors Robin Bergenthum, Sebastian Mauser
Comments (0)