Van Glabbeek, Goltz & Schicke 2011: Multiset Steps and Semantic Conflict

The complete eight-page author version of Rob van Glabbeek, Ursula Goltz, and Jens-Wolfhard Schicke's Abstract Processes of Place/Transition Systems was read through the official arXiv PDF web surface. Both numbered figures and every formal block were inspected. No local PDF object was obtained, so this record deliberately has no archived file, byte count, or hash. The published paper's correct DOI is 10.1016/j.ipl.2011.03.013.

Multiset steps and semantic commutation #

Definitions 1–4 on author-version pages 2–3 treat markings and transition steps as multisets. A finite nonempty step $G$ is enabled when its total pre-multiset is contained in the marking; firing subtracts that total input and adds the total output. Multiplicity is load-bearing: a step may contain several occurrences of one transition when the marking can fund all of them.

The paper states that an enabled pair step $\{t,u\}$ permits both firing words $tu$ and $ut$. Their equal final marking follows directly by applying the firing equation twice; it is a GTK derivation, not a separately named theorem in the paper. Definition 11 on page 6 makes the commutation boundary precise: adjacent firings may be swapped only after a common prefix at whose reached marking the pair step is enabled. This is marking-dependent concurrency, not a global syntactic independence relation.

Conflict is not only pairwise #

Definition 9 on page 5 calls a finite nonempty multiset $G$ semantically conflicting when every one-transition restriction $G|_{\{t\}}$, retaining the full multiplicity of $t$, is enabled but the whole step $G$ is not. For a pair, that means both transitions are individually enabled while their joint step is disabled. It does not mean that firing one necessarily leaves the other disabled: a transition may immediately replenish the shared input token.

Figure 2 gives the higher-arity boundary. With two tokens and three transitions sharing the place, every pair can fire together while the triple cannot; with three tokens, that conflict disappears without any structural change. Shared input arcs alone therefore do not determine behavioral conflict in a general multi-token P/T net.

Source boundaries #

The paper does not define free-choice nets, classical confusion, incidence matrices, invariants, boundedness algorithms, or liveness. Its model also requires every transition to have a nonempty preset, whereas the GTK baseline permits input-free source transitions. Use it for multiset steps, semantic conflict, and marking-dependent commutation only.

The author version is arXiv:1103.5916. A DOI encountered during discovery, 10.3233/FI-2011-385, belongs to an unrelated database-theory paper and must not be attached to this source.