相关论文: 1-Safe Petri nets and special cube complexes: equi…
In recent work, the second and third authors introduced a technique for reachability checking in 1-bounded Petri nets, based on wiring decompositions, which are expressions in a fragment of the compositional algebra of nets with boundaries.…
Numerous tasks in program analysis and synthesis reduce to deciding reachability in possibly infinite graphs such as those induced by Petri nets. However, the Petri net reachability problem has recently been shown to require non-elementary…
We study notions of hyperuniformity for invariant locally square-integrable point processes in regular trees. We show that such point processes are never geometrically hyperuniform, and if the diffraction measure has support in the…
In this paper we prove the following results (via a unified approach) for all sufficiently large $n$: (i) [$1$-factorization conjecture] Suppose that $n$ is even and $D\geq 2\lceil n/4\rceil -1$. Then every $D$-regular graph $G$ on $n$…
A cornerstone of extremal graph theory due to Erd\H{o}s and Stone states that the edge density which guarantees a fixed graph $F$ as subgraph also asymptotically guarantees a blow-up of $F$ as subgraph. It is natural to ask whether this…
Twisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these…
We consider approaches for causal semantics of Petri nets, explicitly representing dependencies between transition occurrences. For one-safe nets or condition/event-systems, the notion of process as defined by Carl Adam Petri provides a…
In this paper, we study an extension of the CPE conjecture to manifolds $M$ which support a structure relating curvature to the geometry of a smooth map $\varphi : M \to N$. The resulting system, denoted by $(\varphi-\mathrm{CPE})$, is…
Surface probes such as scanning tunneling microscopy (STM) have detected complex patterns at the nanoscale, indicative of electronic inhomogeneity, in a variety of high temperature superconductors. In cuprates, the pattern formation is…
We introduce immediate observation Petri nets, a class of interest in the study of population protocols (a model of distributed computation), and enzymatic chemical networks. In these areas, relevant analysis questions translate into…
We present a model checking approach for the verification of data flow correctness in networks during concurrent updates of the network configuration. This verification problem is of great importance for software-defined networking (SDN),…
The totally asymmetric simple exclusion process (TASEP), a well-known model in its strictly one-dimensional (chain) version, is generalized to cylinder (nanotube) and ribbon (nanoribbon) geometries. A mean-field theoretical description is…
Confirming a conjecture posed by Caro, it was shown by Chen and Yu that every graph $G$ with $n$ vertices and at most $2n-4$ edges has a stable cutset, which is a stable set of vertices whose removal disconnects the graph. Le and Pfender…
Nested graphs have been used in different applications, for example to represent knowledge in semantic networks. On the other hand, graphs with cycles are really important in surface reconstruction, periodic schedule and network analysis.…
Detectability describes the property of a system to uniquely determine, after a finite number of observations, the current and subsequent states. In this paper, to reduce the complexity of checking the detectability properties in the…
In this note we consider the survivable network design problem (SNDP) in undirected graphs. We make two contributions. The first is a new counting argument in the iterated rounding based 2-approximation for edge-connectivity SNDP (EC-SNDP)…
Place/Transition Petri nets with inhibitor arcs (PTI nets for short), which are a well-known Turing-complete, distributed model of computation, are equipped with a decidable, behavioral equivalence, called pti-place bisimilarity, that…
Petri nets, also known as vector addition systems, are a long established model of concurrency with extensive applications in modelling and analysis of hardware, software and database systems, as well as chemical, biological and business…
A recent result by Kardo\v{s}, M\'a\v{c}ajov\'a and Zerafa [J. Comb. Theory, Ser. B. 160 (2023) 1--14] related to the famous Berge-Fulkerson conjecture implies that given an arbitrary set of odd pairwise edge-disjoint cycles, say $\mathcal…
Let $G$ be a bridgeless cubic graph. The Berge--Fulkerson Conjecture (1970s) states that $G$ admits a list of six perfect matchings such that each edge of $G$ belongs to exactly two of these perfect matchings. If answered in the…