Related papers: Unbounded product-form Petri nets
Persistence is a strong, global, behavioural property of a Petri net, meaning that no activity can disable a different activity. Persistent permutability is a weaker property, pertaining to individual interleavings of a Petri net and…
We show that general string-net condensed states have a natural representation in terms of tensor product states (TPS) . These TPS's are built from local tensors. They can describe both states with short-range entanglement (such as the…
Boolean Petri nets equipped with nop allow places and transitions to be independent by being related by nop. We characterize for any fixed natural number g the computational complexity of synthesizing nop-equipped Boolean Petri nets from…
State estimation plays a key role in the transition from the passive to the active operation of distribution systems, as it allows to monitor these networks and, successively, to perform control actions. However, designing state estimators…
Given a discounted cost, we study deterministic discrete-time systems whose inputs are generated by policy iteration (PI). We provide novel near-optimality and stability properties, while allowing for non stabilizing initial policies. That…
This paper presents a set of algorithms for computing the reachability graph of Petri Net Product Lines (PNPLs). These algorithms address the combined challenges of concurrency and variability that arise from product-line configurations.…
The analysis of biological networks has benefited from the richness of Boolean networks (BNs) and the associated theory. These results have been further fortified in recent years by the emergence of Most Permissive (MP) semantics, combining…
Petri nets proved useful to describe various real-world systems, but many of their properties are very hard to check. To alleviate this difficulty, subclasses are often considered. The class of weighted marked graphs with relaxed place…
Petri nets are a mathematical language for modeling and reasoning about distributed systems. In this paper we propose an approach to Petri nets for embedding reversibility, i.e., the ability of reversing an executed sequence of operations…
The steady-state degree of a chemical reaction network is the number of complex steady-states for generic rate constants and initial conditions. One way to bound the steady-state degree is through the mixed volume of the steady-state system…
We present a unified framework for Petri nets and various variants, such as pre-nets and Kock's whole-grain Petri nets. Our framework is based on a less well-studied notion that we call $\Sigma$-nets, which allow finer control over whether…
Modelling the evolution of a system using stochastic dynamics typically implies a greater subjective uncertainty in the adopted system coordinates as time progresses, and stochastic entropy production has been developed as a measure of this…
We study a class of Markov processes with finite state space and continuous time that have product form stationary distributions. We obtain a number of examples that can generate conjectures for diffusions with inert drift.
We design several examples of constrained, symmetric quantum circuit dynamics that generate non-equilibrium steady states. The qubit networks maintain local memory of the initial conditions and display inhomogeneous subsystem dynamics over…
Product-form stationary distributions in Markov chains have been a foundational advance and driving force in our understanding of stochastic systems. In this paper, we introduce a new product-form relationship that we call "graph-based…
We consider universal statistical properties of systems that are characterized by phase states with macroscopic degeneracy of the ground state. A possible topological order in such systems is described by non-linear discrete equations. We…
Motivated by queueing systems with heterogeneous parallel servers, we consider a class of structured multi-dimensional Markov processes whose state space can be partitioned into two parts: a finite set of boundary states and a structured…
From the perspective of probability, the stability of growing network is studied in the present paper. Using the DMS model as an example, we establish a relation between the growing network and Markov process. Based on the concept and…
In a previous paper Sharkey et al. [13] proved the exactness of closures at the level of triples for Markovian SIR (susceptible-infected-removed) dynamics on tree-like networks. This resulted in a deterministic representation of the…
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…