The synthesis of Petri nets from path-automatic specifications

Unbounded Petri Net Synthesis

“…Then, the problem is to search for a net N such that G(N ) or L(N ) belongs to the given set. This problem has been solved in [7] for sets of graphs defined by path-automatic specifications, a combination of modal transition systems and automatic graphs. We are currently working on a similar problem in the context of languages.…”

“…This extension owes much to Sénizergues's view of graphs with an automatic structure. Building on his ideas, a wide class of graphs where the P/T-net synthesis problem is decidable was proposed in [7].…”

Synthesis of Coloured Petri Nets from Natural-like Language Descriptions

“…Despite these attempts, however, complex and large-scale models are very hard to build using CPN or their extensions. In order to ease the modelling of complex systems using Petri nets, some synthesis methods have been proposed, both for ordinary Petri nets (Der Jeng & Di Cesare, 1990;Zhou et al, 1992;He et al, 2000;Badouel & Darondeau, 2004;Zhi-Jun et al, 2008;etc. ) and for CPN (Micovsky et al, 1990;Baldassari & Bruno, 1991;Ezpeleta, 1993;Shang et al, 2004;Khadka, 2007;etc.).…”

“…These methods can be classified into two groups. The first group (Der Jeng & Di Cesare, 1990;Zhou et al, 1992;Ezpeleta, 1993;He et al, 2000;Badouel & Darondeau, 2004;Khadka, 2007) includes those methods that preserve the formal nature of Petri nets. In order to achieve this, the methods impose restrictions on the type of situations that can be modelled and do not include the indiscriminate use of shared resources and complex ordering and selecting criteria (AND's, OR's, NOT's, and their combinations).…”

“…He et al (2000) define manufacturing processes in an interface called IDEF3 (Integrated Definition 3) and transform the model obtained to a Petri net using a sequential cluster identification algorithm. Badouel & Darondeau (2004) establish relations that the system to model has with a predefined set of paths and use a bijection to construct a Petri net of the system. Khadka (2007) uses a sequence chart to represent the system and transforms the chart to a CPN using a tool called LSCTOCPN (Live Sequence Charts to CPN).…”