Representation of a swapping class by one net

Abstract

Processes of Petri nets correspond to sets of firing sequences, and processes offer a graphical representation of their sets of compatible firing sequences by one net. For a contact-free C/E-net these sets form a partition of the set of all firing sequences, but this does not hold for a P/T-net. To get a similar, nice result for P/T-nets, swapping and based upon it two equivalence notions, one for processes and one for firing sequences were introduced in [BeDe]. We discuss the problem of representing such an equivalence class of sequences by one net. We obtain a solution for S-nets, thus gainig insight into the nature of the swapping classes for these nets.