Syntactic Markovian Bisimulation for Chemical Reaction Networks

@inproceedings{Cardelli2017SyntacticMB,
  title={Syntactic Markovian Bisimulation for Chemical Reaction Networks},
  author={Luca Cardelli and Mirco Tribastone and Max Tschaikowski and Andrea Vandin},
  booktitle={Models, Algorithms, Logics and Tools},
  year={2017}
}
In chemical reaction networks (CRNs) with stochastic semantics based on continuous-time Markov chains (CTMCs), the typically large populations of species cause combinatorially large state spaces. This makes the analysis very difficult in practice and represents the major bottleneck for the applicability of minimization techniques based, for instance, on lumpability. In this paper we present syntactic Markovian bisimulation (SMB), a notion of bisimulation developed in the Larsen-Skou style of… 
Verifying Chemical Reaction Network Implementations: A Bisimulation Approach
TLDR
It is shown that by interpreting each implementation species as a set of formal species, the concept of weak bisimulation can be adapted to CRNs in a way that agrees with an intuitive notion of a correct implementation.
Exact maximal reduction of stochastic reaction networks by species lumping
TLDR
An exact lumping method for stochastic reaction networks with mass-action kinetics that hinges on an equivalence relation between the species, resulting in a reduced network where the dynamics of each macro-species is stochastically equivalent to the sum of the original species in each equivalence class.
A Large-Scale Assessment of Exact Model Reduction in the BioModels Repository
TLDR
A family of techniques for both deterministic and stochastic networks which are based on equivalence relations over the species in the network are considered, leading to a coarse graining which provides the exact aggregate time-course evolution for each equivalence class.
Population Protocols: Expressiveness, Succinctness and Automatic Verification
TLDR
This thesis exhibits a subclass of population protocols that is efficiently decidable and suitable for automatic verification, and introduces broadcast protocols, which extend population protocols by the ability to transmit reliable broadcast signals simultaneously received.
Automated Deep Abstractions for Stochastic Chemical Reaction Networks
Lumping the Approximate Master Equation for Multistate Processes on Complex Networks
TLDR
This work proposes an efficient approach for the numerical solution of the AME that exploits similarities between the differential equations of structurally similar groups of nodes, and cluster a large number of similar equations together and solve only a single lumped equation per cluster.
SPEEDING UP STOCHASTIC AND DETERMINISTIC SIMULATION BY AGGREGATION: AN ADVANCED TUTORIAL
TLDR
This paper offers an advanced tutorial on an array of recently developed algorithms that seek to tame the complexity of these models by aggregating their constituting systems of equations, leading to lower-dimensional systems that preserve the original dynamics in some appropriate, formal sense.
SPEEDING UP STOCHASTIC AND DETERMINISTIC SIMULATION BY AGGREGATION: AN ADVANCED TUTORIAL
TLDR
This paper offers an advanced tutorial on an array of recently developed algorithms that seek to tame the complexity of these models by aggregating their constituting systems of equations, leading to lower-dimensional systems that preserve the original dynamics in some appropriate, formal sense.
...
...

References

SHOWING 1-10 OF 60 REFERENCES
Forward and Backward Bisimulations for Chemical Reaction Networks
TLDR
A unified algorithm is provided that computes the coarsest refinement up to the authors' bisimulations in polynomial time and algorithms to compute quotient CRNs induced by a bisimulation are given.
Differential Bisimulation for a Markovian Process Algebra
TLDR
This work presents differential bisimulation, a behavioral equivalence developed as the ODE counterpart of bisimulations for languages with probabilistic or stochastic semantics, and provides an efficient partition-refinement algorithm to compute the coarsest ODE aggregation of a model according to differential bisIMulation.
Deciding Bisimilarity and Similarity for Probabilistic Processes
TLDR
Algorithms for computing this bisimulation equivalence classes as introduced by Larsen and Skou, the simulation preorder a la Segala and Lynch, and the reduction to maximum flow problems in suitable networks are presented.
Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective
TLDR
This work uses a categorical framework to extend and relate model-comparison approaches based on structural and dynamical properties of a CRN to prove their equivalence, and provides an algorithm to compare CRNs, running linearly in time with respect to the cardinality of all possible comparisons.
EGAC: a genetic algorithm to compare chemical reaction networks
TLDR
This paper develops a genetic algorithm for a class of CRNs called influence networks, which can be used to model a variety of biological systems including cell-cycle switches and gene networks and can successfully establish relations between influence networks from the literature which cannot be found by exact algorithms due to their large computational requirements.
Efficient Syntax-Driven Lumping of Differential Equations
TLDR
Numerical experiments on real-world models from biochemistry, electrical engineering, and structural mechanics show that the prototype is able to handle ODEs with millions of variables and monomials, providing significant model reductions.
Computation with finite stochastic chemical reaction networks
TLDR
This work shows a design of a chemical computer that achieves fast and reliable Turing-universal computation using molecular counts, and demonstrates that molecular counts can be a useful form of information for small molecular systems such as those operating within cellular environments.
Symbolic computation of differential equivalences
TLDR
This work proposes differential equivalence relations for biochemical models from the literature that cannot be reduced using competing automatic techniques, and provides novel symbolic procedures to check an equivalence and compute the largest one via partition refinement algorithms that use satisfiability modulo theories.
Adaptive Aggregation of Markov Chains: Quantitative Analysis of Chemical Reaction Networks
TLDR
This work proposes a novel numerical approach that combines the strengths of aggregation techniques (state-space reduction) with those of simulation-based approaches (automatic updates that adapt to the process dynamics) and provides rigorous precision guarantees under different measures.
...
...