In: Rozenberg, G.: Lecture Notes in Computer Science, Vol. 424; Advances in Petri Nets 1989, pages 467-486. Berlin, Germany: Springer-Verlag, 1990.
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 result for P/T-nets, swapping and based upon it two equivalence notions, one for processes and one for firing sequences were introduced by Best and Devillers. The author discusses the problem of representing such an equivalence class of sequences by one net. A solution is obtained for S-nets.
Keywords: swapping class; equivalence (of) firing sequences; predicate/transition net; S net.