2026/02/28 by Petr Jancar, Eike Best, Raymond Devillers +1
Computer Science · #cs.FL
arxiv created 2026/07/30 · arxiv updated 2026/07/31
The theory of free-choice Petri nets is an established field, initiated in the 1970s by F. Commoner and M. Hack. We revisit well-formed free-choice nets (those admitting markings that are both live and bounded) and provide a new characterisation by introducing semi-T-components. This notion is dual to that of semi-S-components, which in turn correspond to the well-known minimal siphons. By highlighting the symmetry between these dual concepts, we derive the classical coverability theorems for T- and S-components, as well as the duality theorem---stating that a free-choice net is well-formed if and only if its reverse-dual is also well-formed---using highly symmetric arguments.