A Counterexample to Thiagarajan's Conjecture on Regular Event Structures

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 $\natural$-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 of regular event structures (with bounded $\natural$-cliques) admit a regular nice labeling. To disprove these conjectures, we describe a regular event domain (with bounded $\natural$-cliques) that does not admit a regular nice labeling. Our counterexample is derived from an example by Wise (1996 and 2007) of a nonpositively curved square complex whose universal cover is a CAT(0) square complex containing a particular plane with an aperiodic tiling. We prove that other counterexamples to Thiagarajan's conjecture arise from aperiodic 4-way deterministic tile sets of Kari and Papasoglu (1999) and Lukkarila (2009). On the positive side, using breakthrough results by Agol (2013) and Haglund and Wise (2008, 2012) from geometric group theory, we prove that Thiagarajan's conjecture is true for regular event structures whose domains occur as principal filters of hyperbolic CAT(0) cube complexes which are universal covers of finite nonpositively curved cube complexes.

[1]  Glynn Winskel,et al.  An introduction to event structures , 1988, REX Workshop.

[2]  A. O. Houcine On hyperbolic groups , 2006 .

[3]  Ian Agol,et al.  The virtual Haken conjecture , 2012, 1204.2810.

[4]  Victor Chepoi Nice Labeling Problem for Event Structures: A Counterexample , 2012, SIAM J. Comput..

[5]  Jarkko Kari,et al.  Deterministic Aperiodic Tile Sets , 1999 .

[6]  Gordon D. Plotkin,et al.  Concrete Domains , 1993, Theor. Comput. Sci..

[7]  Brigitte Rozoy,et al.  Finite Labelling Problem in Event Structures , 1994, Theor. Comput. Sci..

[8]  Victor Chepoi,et al.  A counterexample to Thiagarajan's conjecture , 2016, ArXiv.

[9]  Glynn Winskel,et al.  Probabilistic event structures and domains , 2004, Theor. Comput. Sci..

[10]  M. Bridson,et al.  Metric Spaces of Non-Positive Curvature , 1999 .

[11]  P. S. Thiagarajan,et al.  Event Structures and Trace Monoids , 1991, Theor. Comput. Sci..

[12]  Mark F. Hagen,et al.  Weak hyperbolicity of cube complexes and quasi‐arboreal groups , 2011, 1101.5191.

[13]  R. Robinson Undecidability and nonperiodicity for tilings of the plane , 1971 .

[14]  Ville Lukkarila The 4-way deterministic tiling problem is undecidable , 2009, Theor. Comput. Sci..

[15]  Victor Chepoi,et al.  On embeddings of CAT(0) cube complexes into products of trees via colouring their hyperplanes , 2011, J. Comb. Theory B.

[16]  Jean-Pierre Barthélemy,et al.  Median graphs, parallelism and posets , 1993, Discret. Math..

[17]  H. Bandelt,et al.  Metric graph theory and geometry: a survey , 2006 .

[18]  Hans-Jürgen Bandelt,et al.  Median algebras , 1983, Discret. Math..

[19]  H. Bandelt,et al.  Embedding Topological Median Algebras in Products of Dendrons , 1989 .

[20]  Martin Roller Poc Sets, Median Algebras and Group Actions , 2016 .

[21]  D. Wise From Riches to Raags: 3-Manifolds, Right-Angled Artin Groups, and Cubical Geometry , 2012 .

[22]  Rémi Morin Concurrent Automata vs. Asynchronous Systems , 2005, MFCS.

[23]  David E. Muller,et al.  The Theory of Ends, Pushdown Automata, and Second-Order Logic , 1985, Theor. Comput. Sci..

[24]  R. Ho Algebraic Topology , 2022 .

[25]  D. Djoković Distance-preserving subgraphs of hypercubes , 1973 .

[26]  Daniel T. Wise,et al.  Special Cube Complexes , 2008, The Structure of Groups with a Quasiconvex Hierarchy.

[27]  P. S. Thiagarajan Regular Event Structures and Finite Petri Nets: A Conjecture , 2002, Formal and Natural Computing.

[28]  Marek Antoni Bednarczyk,et al.  Categories of asynchronous systems , 1987 .

[29]  Michah Sageev,et al.  Ends of Group Pairs and Non‐Positively Curved Cube Complexes , 1995 .

[30]  Mogens Nielsen,et al.  Models for Concurrency , 1992 .

[31]  Martin R. Bridson,et al.  On the recognition problem for virtually special cube complexes , 2014 .

[32]  Robert L. Berger The undecidability of the domino problem , 1966 .

[33]  Philippe Darondeau,et al.  Context-Free Event Domains are Recognizable , 1999, Inf. Comput..

[34]  Victor Chepoi,et al.  Diameters , centers , and approximating trees of δ-hyperbolic geodesic spaces and graphs ∗ [ Extended Abstract ] , 2007 .

[35]  Glynn Winskel,et al.  Events in computation , 1980 .

[36]  P. S. Thiagarajan,et al.  Regular Event Structures and Finite Petri Nets: The Conflict-Free Case , 2002, ICATPN.

[37]  Daniel T. Wise,et al.  A combination theorem for special cube complexes , 2012 .

[38]  Victor Chepoi,et al.  Graphs of Some CAT(0) Complexes , 2000, Adv. Appl. Math..

[39]  Martin R. Bridson Cube complexes, subgroups of mapping class groups, and nilpotent genus , 2014 .

[40]  S. P. Avann Metric ternary distributive semi-lattices , 1961 .

[41]  H. M. Mulder The interval function of a graph , 1980 .

[42]  Seth Sullivant,et al.  Geodesics in CAT(0) Cubical Complexes , 2011, Adv. Appl. Math..

[43]  P. S. Thiagarajan,et al.  Regular Trace Event Structures , 1996 .

[44]  Daniel T. Wise,et al.  Non-positively curved squared complexes aperiodic tilings and non-residually finite groups , 1996 .

[45]  Peter Winkler,et al.  Isometric embedding in products of complete graphs , 1984, Discret. Appl. Math..

[46]  Michah Sageev,et al.  CAT(0) cube complexes and groups , 2014 .

[47]  Daniel T. Wise Complete square complexes , 2007 .

[48]  Samson Abramsky,et al.  Handbook of logic in computer science. , 1992 .

[49]  Eugene W. Stark Connections between a Concrete and an Abstract Model of Concurrent Systems , 1989, Mathematical Foundations of Programming Semantics.

[50]  Grzegorz Rozenberg,et al.  Transition Systems, Event Structures and Unfoldings , 1991, Inf. Comput..

[51]  M. Habib,et al.  Notes on diameters , centers , and approximating trees of δ-hyperbolic geodesic spaces and graphs , 2008 .

[52]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

[53]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains, Part I , 1981, Theor. Comput. Sci..