This paper describes a synthesis procedure dedicated to the construction of choice-free
Petri nets from finite persistent transition systems, whenever possible. Taking advantage of …

Elementary net systems (ENS) are the most fundamental class of Petri nets. Their synthesis
problem has important applications in the design of digital hardware and commercial …

In Petri net synthesis, a given finite labelled transition system (lts) should be solved by an
injectively labelled Petri net, which means that the reachability graph of the Petri net is …

A Petri net is called fork-attribution if it is choice-free (a unique output transition for each
place) and join-free (a unique input place for each transition). Synthesis tries, for a given …

We present a simple characterization of the set of Petri net solvable binary words. It states
that they are exactly the extensions of the prefixes of Petri net cyclic solvable words, by some …

Region theory, as initiated by Ehrenfeucht and Rozenberg, allows the characterisation of the
class of Petri net synthesisable finite labelled transition systems. Two kinds of problems …

The boundedness problem is a well-known exponential-space complete problem for vector
addition systems with states (or Petri nets); it asks if the reachability set (for a given initial …

A word is called Petri net solvable if it is isomorphic to the reachability graph of an
unlabelled Petri net. In this paper, the class of finite, two-letter, Petri net solvable, words is …

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 extend …

When a Petri net is synthesised from a labelled transition system, it is frequently desirable
that certain additional constraints are fulfilled. For example, in circuit design, one is often …