Synthesis of Petri Nets with Whole-Place Operations and Localities

Synthesising systems from behavioural specifications is an attractive way of constructing implementations which are correct-by-design and thus requiring no costly validation efforts. In this paper, systems are modelled by Petri nets and the behavioural specifications are provided in the form of step transition systems, where arcs are labelled by multisets of executed actions. We focus on the problem of synthesising Petri nets with whole-place operations and localities (wpol-nets), which are a class of Petri nets powerful enough to express a wide range of system behaviours, including inhibition of actions, resetting of local states, and locally maximal executions. The synthesis problem was solved for several specific net classes and later a general approach was developed within the framework of tau-nets. In this paper, we follow the synthesis techniques introduced for tau-nets that are based on the notion of a region of a transition system, which we suitably adapt to work for wpol-nets.