Abstract Processes of Place/Transition Systems

A well-known problem in Petri net theory is to formalise an appropriate causality-based concept of process or run for place/transition systems. The so-called individual token interpretation, where tokens are distinguished according to their causal history, giving rise to the processes of Goltz and Reisig, is often considered too detailed. The problem of defining a fully satisfying more abstract concept of process for general place/transition systems has so-far not been solved. In this paper, we recall the proposal of defining an abstract notion of process, here called BD-process, in terms of equivalence classes of Goltz-Reisig processes, using an equivalence proposed by Best and Devillers. It yields a fully satisfying solution for at least all one-safe nets. However, for certain nets which intuitively have different conflicting behaviours, it yields only one maximal abstract process. Here we identify a class of place/transition systems, called structural conflict nets, where conflict and concurrency due to token multiplicity are clearly separated. We show that, in the case of structural conflict nets, the equivalence proposed by Best and Devillers yields a unique maximal abstract process only for conflict-free nets. Thereby BD-processes constitute a simple and fully satisfying solution in the class of structural conflict nets.

💡 Research Summary

**
The paper tackles a longstanding problem in Petri‑net theory: how to define a causality‑based notion of “run” or “process” for general place/transition (P/T) systems that respects the collective‑token interpretation. The traditional individual‑token interpretation distinguishes tokens by their causal histories, leading to Goltz‑Reisig (GR) processes. While precise, GR‑processes become overly detailed when multiple indistinguishable tokens reside in the same place, because the choice of which token a transition consumes creates different GR‑processes even though the underlying net is conflict‑free.

To obtain a more abstract semantics, the authors adopt the equivalence relation introduced by Best and Devillers (1987), called swapping. Two GR‑processes are considered equivalent if they differ only in the choice of token removed from a place; the equivalence class is called a BD‑process. In one‑safe nets (places hold at most one token) swapping cannot occur, so BD‑processes coincide with isomorphism classes of GR‑processes, preserving the classical causal semantics.

However, for general P/T systems with token multiplicities, swapping alone does not fully capture the intended abstraction because concurrency caused by multiple tokens can be entangled with genuine conflicts. The authors therefore introduce a new subclass of nets, Structural Conflict Nets. These nets satisfy two key properties: (1) conflicts and concurrency due to token multiplicities are cleanly separated, and (2) syntactic conflicts (based on the net’s structure) coincide with semantic conflicts (based on the behavior of processes). In such nets, the flow relation ensures that any two transitions sharing a pre‑place are either in direct conflict or can fire concurrently without ambiguity.

Within this subclass the paper establishes two main theorems:

1. Uniqueness Condition – A Structural Conflict Net has a unique maximal BD‑process iff the net is conflict‑free. If any conflict exists, the swapping equivalence yields multiple maximal BD‑processes, reflecting the different ways the conflict can be resolved.

2. Completeness for Conflict‑Free Nets – Conversely, if a Structural Conflict Net is conflict‑free, it possesses exactly one maximal BD‑process. This aligns with the intuitive expectation that a conflict‑free system should have a single abstract run.

To prove these results, the authors present an alternative characterisation of BD‑processes via firing‑sequence equivalence. Two firing sequences are equivalent if one can be transformed into the other by swapping adjacent transitions that could have been executed in the same step. This sequence‑based equivalence is shown to be identical to the swapping equivalence on GR‑processes. By working with sequences, the authors avoid dealing directly with token identities, simplifying the proof of maximality and uniqueness.

The paper also situates BD‑processes among related work: the categorical morphisms of Meseguer and Montanari, trace‑theoretic approaches of Hooger, Kleijn, and Thiagarajan, and Mazurkiewicz’s multitreelike structures. It demonstrates that BD‑processes provide a bijective correspondence with the equivalence classes of firing sequences, thereby offering a concrete and operationally meaningful abstraction.

In conclusion, the authors deliver a fully satisfying abstract semantics for a significant class of P/T systems. By combining the swapping equivalence with the structural conflict restriction, they obtain a notion of process that abstracts away irrelevant token‑level details while preserving essential causal information. For conflict‑free Structural Conflict Nets the abstraction is unique, delivering a clean, mathematically robust definition of a “run” that aligns with both intuition and formal requirements. This work thus advances the theory of Petri‑net semantics, bridging the gap between the overly detailed individual‑token view and the need for a concise, conflict‑aware abstract execution model.