Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
From MaRDI portal
Publication:1884863
DOI10.1016/j.tcs.2004.03.064zbMath1070.68059OpenAlexW2083227084MaRDI QIDQ1884863
Publication date: 27 October 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.064
Formal languages and automata (68Q45) Dynamical systems in biology (37N25) Biochemistry, molecular biology (92C40) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (9)
Biochemical systems theory: a review ⋮ Verifying chemical reaction network implementations: a bisimulation approach ⋮ Equivalences for a biological process algebra ⋮ Generalizing the Paige-Tarjan algorithm by abstract interpretation ⋮ Bisimulations in calculi modelling membranes ⋮ A semantic equivalence for Bio-PEPA based on discretisation of continuous values ⋮ Inclusion dynamics hybrid automata ⋮ An efficient simulation algorithm based on abstract interpretation ⋮ Timed Concurrent Constraint Programming for Analysing Biological Systems
Uses Software
Cites Work
- Results on the propositional \(\mu\)-calculus
- A linear time solution to the single function coarsest partition problem
- Characterizing finite Kripke structures in propositional temporal logic
- Mathematical models of purine metabolism in man
- HyTech: A model checker for hybrid systems
- Modelling biochemical pathways through enhanced \(\pi\)-calculus
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Taming the complexity of biochemical models through bisimulation and collapsing: theory and practice
