A counterexample to Thiagarajan's conjecture on regular event structures

被引:2
作者
Chalopin, Jeremie [1 ,2 ]
Chepoi, Victor [1 ]
机构
[1] Aix Marseille Univ, Lab Informat & Syst, CNRS, Marseille, France
[2] Univ Toulon & Var, Toulon, France
关键词
Regular event structures; Event domains; Trace labelings; Median graphs; CAT(0) cube complexes; Universal covers; Virtually special cube complexes; Aperiodic tilings; CUBE COMPLEXES; PETRI NETS; PRODUCTS; UNDECIDABILITY; AUTOMATA; GRAPHS; ENDS;
D O I
10.1016/j.jcss.2020.05.001
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
We provide a counterexample to a conjecture by Thiagarajan (1996, 2002) that regular event structures correspond 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). Using that domains of events structures are CAT(0) cube complexes, we construct our counterexample from an example by Wise (1996, 2007) of a nonpositively curved square complex whose universal cover contains an aperiodic plane. 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 holds for strongly hyperbolic regular event structures. (C) 2020 Elsevier Inc. All rights reserved.
引用
收藏
页码:76 / 100
页数:25
相关论文
共 54 条
[31]  
Hatcher A., 2002, Algebraic Topology
[32]   CONCRETE DOMAINS [J].
KAHN, G ;
PLOTKIN, GD .
THEORETICAL COMPUTER SCIENCE, 1993, 121 (1-2) :187-277
[33]   Deterministic aperiodic tile sets [J].
Kari, J ;
Papasoglu, P .
GEOMETRIC AND FUNCTIONAL ANALYSIS, 1999, 9 (02) :353-369
[34]   The 4-way deterministic tiling problem is undecidable [J].
Lukkarila, Ville .
THEORETICAL COMPUTER SCIENCE, 2009, 410 (16) :1516-1533
[35]  
Morin R, 2005, LECT NOTES COMPUT SC, V3618, P686
[36]  
Mulder Henry Martyn, 1980, Mathematical Centre tracts, V132
[37]   THE THEORY OF ENDS, PUSHDOWN-AUTOMATA, AND 2ND-ORDER LOGIC [J].
MULLER, DE ;
SCHUPP, PE .
THEORETICAL COMPUTER SCIENCE, 1985, 37 (01) :51-75
[38]   TRANSITION-SYSTEMS, EVENT STRUCTURES, AND UNFOLDINGS [J].
NIELSEN, M ;
ROZENBERG, G ;
THIAGARAJAN, PS .
INFORMATION AND COMPUTATION, 1995, 118 (02) :191-207
[39]  
Nielsen M, 2002, LECT NOTES COMPUT SC, V2360, P335
[40]   PETRI NETS, EVENT STRUCTURES AND DOMAINS, .1. [J].
NIELSEN, M ;
PLOTKIN, G ;
WINSKEL, G .
THEORETICAL COMPUTER SCIENCE, 1981, 13 (01) :85-108