Related papers: Reachability in Restricted Chemical Reaction Netwo…
Stochastic Chemical Reaction Networks are continuous time Markov chain models that describe the time evolution of the molecular counts of species interacting stochastically via discrete reactions. Such models are ubiquitous in systems and…
In this paper we study a class of stochastic chemical reaction networks (CRNs) for which chemical species are created by a sequence of chain reactions. We prove that under some convenient conditions on the initial state, some of these…
Broadcast networks allow one to model networks of identical nodes communicating through message broadcasts. Their parameterized verification aims at proving a property holds for any number of nodes, under any communication topology, and on…
Complex networks describe a wide range of systems in nature and society. Frequently cited examples include Internet, WWW, a network of chemicals linked by chemical reactions, social relationship networks, citation networks, etc. The…
The reachability problem in cooperating systems is known to be PSPACE-complete. We show here that this problem remains PSPACE-complete when we restrict the communication structure between the subsystems in various ways. For this purpose we…
The construction of a reaction network containing all relevant intermediates and elementary reactions is necessary for the accurate description of chemical processes. In the case of a complex chemical reaction (involving, for instance, many…
We obtain bounds on the Kullback--Leibler divergence to equilibrium for mass-action chemical reaction networks (CRNs) with equilibrium. The associated decay rates are characterized in terms of the singular values of the stoichiometric…
The paper deals with the verification of reachability properties in a commonly used state transition model of communication protocols, which consists of finite state machines connected by potentially unbounded FIFO channels. Although simple…
Filtering for stochastic reaction networks (SRNs) is an important problem in systems/synthetic biology aiming to estimate the state of unobserved chemical species. A good solution to it can provide scientists valuable information about the…
Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable model for recursive programs with asynchronous atomic…
Well-mixed chemical reaction networks (CRNs) contain many distinct chemical species with copy numbers that fluctuate in correlated ways. While those correlations are typically monitored via Monte Carlo sampling of stochastic trajectories,…
It is useful to have complete lists of nonisomorphic chemical reaction networks (CRNs) of a given size, with or without various restrictions. One may, for example, be interested in exploring how often certain dynamical behaviours occur in…
We consider networks of processes that all execute the same finite-state protocol and communicate via a rendez-vous mechanism. When a process requests a rendez-vous, another process can respond to it and they both change their control…
We propose a unified framework that allows for the full mechanistic reconstruction of chemical reaction networks (CRNs) from concentration data. The framework utilizes an integral formulation of the differential equations governing the…
Chemical reaction networks (CRNs) formally model chemistry in a well-mixed solution. CRNs are widely used to describe information processing occurring in natural cellular regulatory networks, and with upcoming advances in synthetic biology,…
This paper presents a novel contingency planning framework that integrates learning-based multi-modal predictions of traffic participants into Branch Model Predictive Control (MPC). Leveraging reachability analysis, we address the…
In recent years, several combinatorial problems were introduced in the area of access control. Typically, such problems deal with an authorization policy, seen as a relation $UR \subseteq U \times R$, where $(u, r) \in UR$ means that user…
The evolution of chemical reaction networks is often analyzed through kinetic models and energy landscapes, but these approaches fail to capture the deeper structural constraints governing complexity growth. In chemical reaction networks,…
In this paper we consider state reachability in networks composed of many identical processes running a parametric timed broadcast protocol (PTBP). PTBP are a new model extending both broadcast protocols and parametric timed automata. This…
Deep neural networks can be trained to be efficient and effective controllers for dynamical systems; however, the mechanics of deep neural networks are complex and difficult to guarantee. This work presents a general approach for providing…