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

Petri nets are an established graphical formalism for modeling and analyzing the behavior of systems. An important consideration of the value of Petri nets is their use in describing both the syntax and semantics of modeling formalisms.…

We study timed Petri nets, with preselection and priority routing. We represent the behavior of these systems by piecewise affine dynamical systems. We use tools from the theory of nonexpansive mappings to analyze these systems. We…

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 provide a framework for modeling social network formation through conditional multinomial logit models from discrete choice and random utility theory, in which each new edge is viewed as a "choice" made by a node to connect to another…

Although decidable, the marking reachability problem for Petri nets is well-known to be intractable in general, and a non-elementary lower bound has been recently uncovered. In order to alleviate this difficulty, various structural and…

The Deficiency-One Theorem states that there exists a unique positive steady state in each positive stoichiometric class for weakly reversible deficiency-one mass action systems with one linkage class (regardless of the values of the rate…

Information flow security properties were defined some years ago (see, e.g., the surveys \cite{FG01,Ry01}) in terms of suitable equivalence checking problems. These definitions were provided by using sequential models of computations (e.g.,…

The fundamental decomposition of a chemical reaction network (also called its "$\mathscr{F}$-decomposition") is the set of subnetworks generated by the partition of its set of reactions into the "fundamental classes" introduced by Ji and…

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 reachability semantics for Petri nets can be studied using open Petri nets. For us an "open" Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the…

The Feinberg-Piunovskiy Theorem established in [14, Theorem 3.8] asserts that for a discrete-time uniformly absorbing and atomless Markov Decision Process (MDP) with Borel state space and multiple criteria, the family of deterministic…

We derive a simple sufficient condition for the local asymptotic stability of spatially discrete, continuous-time reaction-diffusion systems of networked dynamical systems at a homogeneous equilibrium point. The framework explicitly…

We prove that if a given reaction network $\mathcal{N}$ has a weakly reversible deficiency zero realization for all choice of rate constants, then there exists a $\textit{unique}$ weakly reversible deficiency zero network $\mathcal{N}'$…

In many complex systems that can be modeled using Petri nets time can be a very important factor which should be taken into account during creation and analysis of the model. Time data can describe starting moments of some actions or their…

Petri nets are a popular formalism for modeling and analyzing distributed systems. Tokens in Petri net models can represent the control flow state or resources produced/consumed by transition firings. We define a resource as a part (a…

A (control) network over a finite ring is proposed. Using semi-tensor product (STP) of matrices, a set of algebraic equations are provided to verify whether a finite set with two binary operators is a ring. It is then shown that the…

We review product form blocking measures in the general framework of nearest neighbor asymmetric one dimensional misanthrope processes. This class includes exclusion, zero range, bricklayers, and many other models. We characterize the cases…

Finite 1-safe Petri nets, also called \emph{net systems}, are natural models of asynchronous concurrency. The event structure of a net system describes all its possible executions and their concurrent nature: two events may be causally…

We propose a framework for the specification of behaviour-preserving reconfigurations of systems modelled as Petri nets. The framework is based on open nets, a mild generalisation of ordinary Place/Transition nets suited to model open…

We investigate six operations on chemical reaction networks, all of which have been proven to preserve important dynamical properties, namely, the capacity for nondegenerate multistationarity (multiple steady states) and periodic orbits.…