1,674 research outputs found
1-Safe Petri nets and special cube complexes: equivalence and applications
Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net
unfolds into an event structure . 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
one can associate a finite special cube complex such that the
domain of the event structure (obtained as the unfolding of
) is a principal filter of the universal cover of .
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
which arises from a virtually special square complex . The domain of
is grid-free (because it is hyperbolic), but the MSO
theory of the event structure is undecidable
Generic and special constructions of pure O-sequences
It is shown that the h-vectors of Stanley-Reisner rings of three classes of
matroids are pure O-sequences. The classes are (a) matroids that are
truncations of other matroids, or more generally of Cohen-Macaulay complexes,
(b) matroids whose dual is (rank + 2)-partite, and (c) matroids of
Cohen-Macaulay type at most five. Consequences for the computational search for
a counterexample to a conjecture of Stanley are discussed.Comment: 16 pages, v2: various small improvements, accepted by Bulletin of the
London Math. Societ
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems
We prove a general finite convergence theorem for "upward-guarded" fixpoint
expressions over a well-quasi-ordered set. This has immediate applications in
regular model checking of well-structured systems, where a main issue is the
eventual convergence of fixpoint computations. In particular, we are able to
directly obtain several new decidability results on lossy channel systems.Comment: 16 page
Reliability models for dataflow computer systems
The demands for concurrent operation within a computer system and the representation of parallelism in programming languages have yielded a new form of program representation known as data flow (DENN 74, DENN 75, TREL 82a). A new model based on data flow principles for parallel computations and parallel computer systems is presented. Necessary conditions for liveness and deadlock freeness in data flow graphs are derived. The data flow graph is used as a model to represent asynchronous concurrent computer architectures including data flow computers
Computations by fly-automata beyond monadic second-order logic
We present logically based methods for constructing XP and FPT graph
algorithms, parametrized by tree-width or clique-width. We will use
fly-automata introduced in a previous article. They make possible to check
properties that are not monadic second-order expressible because their states
may include counters, so that their sets of states may be infinite. We equip
these automata with output functions, so that they can compute values
associated with terms or graphs. Rather than new algorithmic results we present
tools for constructing easily certain dynamic programming algorithms by
combining predefined automata for basic functions and properties.Comment: Accepted for publication in Theoretical Computer Scienc
- …