Context
The symmetry of the rewrite relation is essential: polynomial ideals forget direction.
Definitions
- A marking is a finite multiset of pairs (data value, place).
- Orbit-finite rules are represented by finitely many rule orbits under data renaming.
Hypotheses and scope
- The data domain is homogeneous when embeddings on finite supports are replaced by automorphisms.
- Algorithmic claims additionally need an effective representation of orbits and embeddings.
Proof or evidence
This model is the common interface between reversible data Petri nets and equivariant binomial ideals.
Verification notes
Reversibility, homogeneity, orbit-finiteness, and effectiveness were recorded as separate requirements.
Limitations
- Abstract homogeneity and WQO assumptions alone do not specify an algorithm.