15,527 research outputs found

    1-Safe Petri nets and special cube complexes: equivalence and applications

    Full text link
    Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net NN unfolds into an event structure EN\mathcal{E}_N. By a result of Thiagarajan (1996 and 2002), these unfoldings are exactly the trace regular event structures. Thiagarajan (1996 and 2002) conjectured that regular event structures correspond exactly to trace regular event structures. In a recent paper (Chalopin and Chepoi, 2017, 2018), we disproved this conjecture, based on the striking bijection between domains of event structures, median graphs, and CAT(0) cube complexes. On the other hand, in Chalopin and Chepoi (2018) we proved that Thiagarajan's conjecture is true for regular event structures whose domains are principal filters of universal covers of (virtually) finite special cube complexes. In the current paper, we prove the converse: to any finite 1-safe Petri net NN one can associate a finite special cube complex XN{X}_N such that the domain of the event structure EN\mathcal{E}_N (obtained as the unfolding of NN) is a principal filter of the universal cover X~N\widetilde{X}_N of XNX_N. This establishes a bijection between 1-safe Petri nets and finite special cube complexes and provides a combinatorial characterization of trace regular event structures. Using this bijection and techniques from graph theory and geometry (MSO theory of graphs, bounded treewidth, and bounded hyperbolicity) we disprove yet another conjecture by Thiagarajan (from the paper with S. Yang from 2014) that the monadic second order logic of a 1-safe Petri net is decidable if and only if its unfolding is grid-free. Our counterexample is the trace regular event structure E˙Z\mathcal{\dot E}_Z which arises from a virtually special square complex Z˙\dot Z. The domain of E˙Z\mathcal{\dot E}_Z is grid-free (because it is hyperbolic), but the MSO theory of the event structure E˙Z\mathcal{\dot E}_Z is undecidable

    A counterexample to Thiagarajan's conjecture on regular event structures

    Full text link
    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

    Inverse monoids and immersions of 2-complexes

    Get PDF
    It is well known that under mild conditions on a connected topological space X\mathcal X, connected covers of X\mathcal X may be classified via conjugacy classes of subgroups of the fundamental group of X\mathcal X. In this paper, we extend these results to the study of immersions into 2-dimensional CW-complexes. An immersion f:D→Cf : {\mathcal D} \rightarrow \mathcal C between CW-complexes is a cellular map such that each point y∈Dy \in {\mathcal D} has a neighborhood UU that is mapped homeomorphically onto f(U)f(U) by ff. In order to classify immersions into a 2-dimensional CW-complex C\mathcal C, we need to replace the fundamental group of C\mathcal C by an appropriate inverse monoid. We show how conjugacy classes of the closed inverse submonoids of this inverse monoid may be used to classify connected immersions into the complex

    Generalizing the rotation interval to vertex maps on graphs

    Full text link
    Graph maps that are homotopic to the identity and that permute the vertices are studied. Given a periodic point for such a map, a {\em rotation element} is defined in terms of the fundamental group. A number of results are proved about the rotation elements associated to periodic points in a given edge of the graph. Most of the results show that the existence of two periodic points with certain rotation elements will imply an infinite family of other periodic points with related rotation elements. These results for periodic points can be considered as generalizations of the rotation interval for degree one maps of the circle
    • …
    corecore