Forward and Backward Bisimulations for Chemical Reaction Networks

DOI10.4230/LIPIcs.CONCUR.2015.226zbMath1374.68204arXiv1507.00163OpenAlexW1270629017MaRDI QIDQ5357706

Max Tschaikowski, Luca Cardelli, Mirco Tribastone, Andrea Vandin

Publication date: 12 September 2017

Full work available at URL: https://arxiv.org/abs/1507.00163

zbMATH Keywords

ordinary differential equationsbisimulationchemical reaction networkspartition refinement

Mathematics Subject Classification ID

Related Items (18)

Complete characterization for the fit-preserving data refinement of mass-action reaction networks ⋮ Unnamed Item ⋮ Reducing Boolean networks with backward Boolean equivalence ⋮ Equivalences for fluid stochastic Petri nets ⋮ Verifying chemical reaction network implementations: a bisimulation approach ⋮ Comparing chemical reaction networks: a categorical and algorithmic perspective ⋮ An automated quantitative information flow analysis for concurrent programs ⋮ Formal lumping of polynomial differential equations through approximate equivalences ⋮ An algorithm for the formal reduction of differential equations as over-approximations ⋮ Approximate constrained lumping of polynomial differential equations ⋮ Algebra, Coalgebra, and Minimization in Polynomial Differential Equations ⋮ A large-scale assessment of exact lumping of quantitative models in the biomodels repository ⋮ Verifying polymer reaction networks using bisimulation ⋮ A logical and graphical framework for reaction systems ⋮ A process algebraic approach to reaction systems ⋮ Symbolic computation of differential equivalences ⋮ Quantitative Abstractions for Collective Adaptive Systems ⋮ Logical characterization of fluid equivalences

This page was built for publication: Forward and Backward Bisimulations for Chemical Reaction Networks