On Reduction and Synthesis of Petri's Cycloids

Cycloids are particular Petri nets for modelling processes of actions and events, belonging to the fundaments of Petri’s general systems theory. Defined by four parameters they provide an algebraic formalism to describe strongly synchronized sequential processes. To further investigate their structure, reduction systems of cycloids are defined in the style of rewriting systems and properties of irreducible cycloids are proved. In particular the synthesis of cycloid parameters from their Petri net structure is derived, leading to an efficient method for a decision procedure for cycloid isomorphism.

💡 Research Summary

The paper investigates a special class of Petri nets introduced by C.A. Petri, called cycloids, which are defined by four integer parameters α, β, γ, δ. A cycloid can be seen as the folding of an infinite Petri space (an infinite marked graph) onto a finite fundamental parallelogram whose sides have lengths α, β (horizontal) and γ, δ (vertical). The number of transitions inside the parallelogram is A = α·δ + β·γ, and the net models a circular queue of β tokens (e.g., cars) interleaved with α gaps.

The authors first formalise cycloids using a matrix‑based “cycloid algebra”. This algebra enables a closed‑form expression for the equivalence of any transition in the infinite Petri space with its representative inside the fundamental parallelogram (Theorems 2.5 and 2.16). With this tool they prove that shear mappings—linear transformations that shift coordinates—are net isomorphisms (Theorem 2.6) and, more importantly, cycloid isomorphisms (Definition 4.1, Theorem 4.3).

Building on the algebraic foundation, the paper introduces a set of rewriting rules that constitute a reduction system for cycloids. The primary reduction, called β‑δ‑reduction, repeatedly applies shear isomorphisms to decrease the parameters β and δ, exactly as Euclid’s algorithm reduces a pair of integers to their greatest common divisor. The process terminates in a β‑δ‑irreducible cycloid, where β and δ are coprime (Theorem 4.6). For such irreducible forms the minimal cycle length p = A/β can be computed directly, and the whole net structure is uniquely determined by the parameters.

The central contribution is a synthesis algorithm that, given an arbitrary Petri net representing a cycloid (potentially with thousands of transitions), reconstructs the original four parameters. The algorithm works in three stages: (1) extract β and δ from the net’s path‑length properties using the irreducibility results; (2) reverse the shear transformations to obtain α and γ; (3) verify the reconstruction by checking the count A = α·δ + β·γ. Because each stage involves only logarithmic‑size arithmetic, the overall complexity is O(log n) where n = max{β, δ} (Theorem 4.9).

A direct corollary is an efficient decision procedure for cycloid isomorphism. Two cycloids C₁(α₁,β₁,γ₁,δ₁) and C₂(α₂,β₂,γ₂,δ₂) are isomorphic iff their irreducible forms coincide; thus one can reduce both to β‑δ‑irreducible cycloids and compare the resulting parameters, again in O(log n) time. This dramatically improves over generic graph‑isomorphism algorithms, whose complexity is believed to be NP‑intermediate.

The paper also revisits classic examples such as the “4‑seasons” cycloid, showing that it is isomorphic to a regular cycloid with parameters (2, 3, 3, 3) via the presented shear and reduction techniques. Overall, the work blends linear algebra, rewriting‑system theory, and number‑theoretic reduction to deliver both theoretical insights into the structure of Petri‑based cycloids and practical tools for parameter synthesis and isomorphism testing.