Abstract

We discuss the problem of constructing PT-nets with localities (PTL-nets) from transition systems with arcs labelled by multisets of transitions (steps). We first outline how this can be done within the existing general solution based on the regions of step transition systems and fixed co-location relations. We then drop the latter assumption and show that this does not really matter when one aims at synthesising PTL-nets where all conflicts involve conflicts between co-located transitions.

Keywords

Petri nets, localities, regions of transition systems, conflict