A counterexample to Thiagarajan's conjecture on regular event structures
J\'er\'emie Chalopin, Victor Chepoi

TL;DR
This paper disproves Thiagarajan's conjecture by providing a counterexample of a regular event structure that cannot be labeled regularly, using geometric and combinatorial constructions related to CAT(0) cube complexes.
Contribution
It introduces a specific counterexample to Thiagarajan's conjecture, connecting geometric group theory with concurrency models, and proves the conjecture holds under certain hyperbolic conditions.
Findings
Counterexample derived from Wise's nonpositively curved square complex.
Disproves the conjecture that regular event structures always admit a regular nice labeling.
Proves the conjecture holds for hyperbolic CAT(0) cube complex domains.
Abstract
We provide a counterexample to a conjecture by Thiagarajan (1996 and 2002) that regular event structures correspond exactly to event structures obtained as unfoldings of finite 1-safe Petri nets. The same counterexample is used to disprove a closely related conjecture by Badouel, Darondeau, and Raoult (1999) that domains of regular event structures with bounded -cliques are recognizable by finite trace automata. Event structures, trace automata, and Petri nets are fundamental models in concurrency theory. There exist nice interpretations of these structures as combinatorial and geometric objects. Namely, from a graph theoretical point of view, the domains of prime event structures correspond exactly to median graphs; from a geometric point of view, these domains are in bijection with CAT(0) cube complexes. A necessary condition for both conjectures to be true is that domains…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
