相关论文: Deficiency Zero Petri Nets and Product Form

Many one-dimensional lattice particle models with open boundaries, like the paradigmatic Asymmetric Simple Exclusion Process (ASEP), have their stationary states represented in the form of a matrix product, with matrices that do not…

Experiments with networks of discrete reactive bistable electrochemical elements organized in regular and nonregular tree networks are presented to confirm an alternative to the Turing mechanism for the formation of self-organized…

In this paper the correspondence between safe Petri nets and event structures, due to Nielsen, Plotkin and Winskel, is extended to arbitrary nets without self-loops, under the collective token interpretation. To this end we propose a more…

This article focuses on comparing the notions of home spaces and invariants, in Transition Systems and more particularly, in Petri Nets as well as a variety of derived Petri Nets. After recalling basic notions of Petri Nets and semiflows,…

Multistationary chemical reaction networks are of interest to scientists and mathematicians alike. While some criteria for multistationarity exist, obtaining explicit reaction rates and steady states that exhibit multistationarity for a…

When checking concurrent software using a finite-state model, we face a formidable state explosion problem. One solution to this problem is dependence-based program slicing, whose use can effectively reduce verification time. It is…

We study a one-dimensional anisotropic exclusion model describing particles moving deterministically on a ring with a single defect across which they move with probability 0 < q < 1. We show that the stationary state of this model can be…

In the context of network dynamics, the complexity of systems increases possible evolutionary paths that often are not deterministic. Occasionally, some map routs form over the course of time which guide systems towards some particular…

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

In a live and bounded Free Choice Petri net, pick a non-conflicting transition. Then there exists a unique reachable marking in which no transition is enabled except the selected one. For a routed live and bounded Free Choice net, this…

Consider the infinite Atlas model: a semi-infinite collection of particles driven by independent standard Brownian motions with zero drifts, except for the bottom-ranked particle which receives unit drift. We derive a continuum…

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…

Inspired from modern out-of-equilibrium statistical physics models, a matrix product based framework permits the formal definition of random vectors (and random time series) whose desired joint distributions are a priori prescribed. Its key…

Multistationarity is the property of a system to exhibit two distinct equilibria (steady-states) under otherwise identical conditions, and it is a phenomenon of recognized importance for biochemical systems. Multistationarity may appear in…

Compositionality and process equivalence are both standard concepts of process algebra. Compositionality means that the behaviour of a compound system relies only on the behaviour of its components, i.e. there is no emergent behaviour.…

In this paper we study online change point detection in dynamic networks with time heterogeneous missing pattern within networks and dependence across the time course. The missingness probabilities, the entrywise sparsity of networks, the…

This paper proposes a semi-structural approach to verify the nonblockingness of a Petri net. We construct a structure, called minimax basis reachability graph (minimax-BRG): it provides an abstract description of the reachability set of a…

In this paper, we study the problem of non-blockingness verification by tapping into the basis reachability graph (BRG). Non-blockingness is a property that ensures that all pre-specified tasks can be completed, which is a mandatory…

The rank of neural networks measures information flowing across layers. It is an instance of a key structural condition that applies across broad domains of machine learning. In particular, the assumption of low-rank feature representations…

Our objective is to design a controlled system with a simple method for discrete event systems based on Petri nets. It is possible to construct the Petri net model of a system and the specification separately. By synchronous composition of…