相关论文: 1-Safe Petri nets and special cube complexes: equi…
We show that plane Cremona groups over finite fields embed as dense subgroups into Neretin groups, i.e. groups of almost automorphisms of rooted trees. We also show that if the finite base field has even characteristic and contains at least…
A Petri net is structurally cyclic if every configuration is reachable from itself in one or more steps. We show that structural cyclicity is decidable in deterministic polynomial time. For this, we adapt the Kosaraju's approach for the…
We review the recent proof of the N.Takahashi's conjecture on genus $0$ Gromov-Witten invariants of $(\mathbb{P}^2, E)$, where $E$ is a smooth cubic curve in the complex projective plane $\mathbb{P}^2$. The main idea is the use of the…
We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the…
The heirarchical mean-field theory of elastic networks, originally developed by Maxwell to discuss the stability of scaffolds, and recently applied to atomic networks by Phillips and Thorpe, explains the phase diagrams and remarkable…
Petri Nets (PN) are a central, theoretically sound model for concurrent or distributed systems but, at least in their classical definition, not expressive enough to represent dynamic reconfiguration capabilities. On the other side,…
In classical network reliability analysis, the system under study is a network with perfect nodes but imperfect link, that fail stochastically and independently. There, the goal is to find the probability that the resulting random graph is…
This paper establishes an analogue of the special chain theorem for the embedding dimension of polynomial rings, with direct application on the (embedding) codimension. In particular, we recover a classic result on the transfer of…
In the setting of Petri nets, we prove that {\em causal-net bisimilarity} \cite{G15,Gor22,Gor25a}, which is a refinement of history-preserving bisimilarity \cite{RT88,vGG89,DDM89}, and the novel {\em hereditary} causal-net bisimilarity,…
In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of…
Precedence constraints are inequalities used to model time dependencies. In 1958, Gallai proved that a finite system of precedence constraints admits solutions if and only if the corresponding precedence graph does not contain…
A non-empty subset $S$ of the vertices of a digraph $D$ is called a {\it safe set} if \begin{itemize} \item[(i)] for every strongly connected component $M$ of $D-S$, there exists a strongly connected component $N$ of $D[S]$ such that there…
In this note, we present a counterexample to a conjecture of Rozoy and Thiagarajan from 1991 (called also the nice labeling problem) asserting that any (coherent) event structure with finite degree admits a labeling with a finite number of…
We consider biochemical systems associated with a generalised class of Petri nets with possibly negative token numbers. We show that the existence of a structural polyhedral Lyapunov function for the biochemical system is equivalent to the…
Concurrent programming is used in all large and complex computer systems. However, concurrency errors and system failures (ex: crashes and deadlocks) are common. We find that Petri nets can be used to model concurrent systems and find and…
Solutions proposed for the longstanding problem of automatic decomposition of Petri nets into concurrent processes, as well as methods developed in Grenoble for the automatic conversion of safe Petri nets to NUPNs (Nested-Unit Petri Nets),…
The verification of safety properties for concurrent systems often reduces to the coverability problem for Petri nets. This problem was shown to be ExpSpace-complete forty years ago. Driven by the concurrency revolution, it has regained a…
Analysis of complex networks, particularly material networks such as the carbon skeleton of hydrocarbons generated in hydrocarbon pyrolysis in carbon-rich systems, is essential for effectively describing, modeling, and predicting their…
Time-Basic Petri nets, is a powerful formalism for modeling real-time systems where time constraints are expressed through time functions of marking's time description associated with transition, representing possible firing times. We…
The Survivable Network Design problem (SNDP) is a well-studied problem, motivated by the design of networks that are robust to faults under the assumption that any subset of edges up to a specific number can fail. We consider non-uniform…