9 citations · 22 across the 8 of their papers we have counts for
4 papers · 1 filter
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…
Synthesis of Weighted Marked Graphs from Constrained Labelled Transition Systems: A Geometric Approach
Raymond Devillers, Evgeny Erofeev, Thomas Hujsa
Recent studies investigated the problems of analysing Petri nets and synthesising them from labelled transition systems (LTS) with two labels (transitions) only. In this paper, we…
A Decidable Characterization of a Graphical Pi-calculus with Iterators
Frédéric Peschanski, Hanna Klaudel, Raymond Devillers
This paper presents the Pi-graphs, a visual paradigm for the modelling and verification of mobile systems. The language is a graphical variant of the Pi-calculus with iterators to…