9 citations · 22 across the 10 of their papers we have counts for
12 papers
Well-Formed Free-Choice Petri Nets Revisited
Petr Jancar, Eike Best, Raymond Devillers +1
The theory of free-choice Petri nets is an established field, initiated in the 1970s by F. Commoner and M. Hack. We revisit well-formed free-choice nets (those admitting markings t…
Persistent Permutability in Choice Petri Nets
Eike Best, Raymond Devillers
Persistence is a strong, global, behavioural property of a Petri net, meaning that no activity can disable a different activity. Persistent permutability is a weaker property, pert…
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets
Raymond Devillers, Ronny Tredup
Synthesis consists in deciding whether a given labeled transition system (TS) can be implemented by a net of type . In case of a negative decision, it may be possible to…
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
Raymond Devillers
In order to speed up the synthesis of Petri nets from labelled transition systems, a divide and conquer strategy consists in defining decompositions of labelled transition systems,…
Synthesis of Pure and Impure Petri nets With Restricted Place-environments: Complexity Issues
Raymond Devillers, Ronny Tredup
Petri net synthesis consists in deciding for a given transition system whether there exists a Petri net whose reachability graph is isomorphic to . Several works examine…
Some Basic Techniques allowing Petri Net Synthesis: Complexity and Algorithmic Issues
Raymond Devillers, Ronny Tredup
In Petri net synthesis we ask whether a given transition system can be implemented by a Petri net . Depending on the level of accuracy, there are three ways how can impl…