Syntactic Markovian Bisimulation for Chemical Reaction Networks

DOI10.1007/978-3-319-63121-9_23zbMath1431.68072arXiv1707.02132OpenAlexW2962837917WikidataQ56981790 ScholiaQ56981790MaRDI QIDQ5217314

Max Tschaikowski, Mirco Tribastone, Andrea Vandin, Luca Cardelli

Publication date: 24 February 2020

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Systems biology, networks (92C42) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (9)

Lumpability for uncertain continuous-time Markov chains ⋮ Verifying chemical reaction network implementations: a bisimulation approach ⋮ Lumping the Approximate Master Equation for Multistate Processes on Complex Networks ⋮ Formal lumping of polynomial differential equations through approximate equivalences ⋮ An algorithm for the formal reduction of differential equations as over-approximations ⋮ A large-scale assessment of exact lumping of quantitative models in the biomodels repository ⋮ Verifying polymer reaction networks using bisimulation ⋮ Automated deep abstractions for stochastic chemical reaction networks ⋮ Logical characterization of fluid equivalences

This page was built for publication: Syntactic Markovian Bisimulation for Chemical Reaction Networks