relation: http://eprints.imtlucca.it/3441/
title: Forward and Backward Bisimulations for Chemical Reaction Networks
creator: Cardelli, Luca
creator: Tribastone, Mirco
creator: Tschaikowski, Max
creator: Vandin, Andrea
subject: QA75 Electronic computers. Computer science
description: We present two quantitative behavioral equivalences over species of a chemical reaction network(CRN) with semantics based on ordinary differential equations.Forward CRN bisimulationiden-tifies a partition where each equivalence class represents the exact sum of the concentrations ofthe species belonging to that class. Backward CRN bisimulationrelates species that have theidentical solutions at all time points when starting from the same initial conditions. Both notionscan be checked using only CRN syntactical information, i.e., by inspection of the set of reactions. We provide a unified algorithm that computes the coarsest refinement up to our bisimulationsin polynomial time. Further, we give algorithms to compute quotient CRNs induced by a bisim-ulation. As an application, we find significant reductions in a number of models of biologicalprocesses from the literature. In two cases we allow the analysis of benchmark models whichwould be otherwise intractable due to their memory requirements.
publisher: LIPICS
date: 2015
type: Conference or Workshop Item
type: PeerReviewed
format: application/pdf
language: en
rights: cc_by_nc
identifier: http://eprints.imtlucca.it/3441/1/concur2015.pdf
identifier:   Cardelli, Luca and Tribastone, Mirco and Tschaikowski, Max and Vandin, Andrea  Forward and Backward Bisimulations for Chemical Reaction Networks.  In: 26th International Conference on Concurrency Theory (CONCUR 2015), September 1–4, 2015, Madrid, Spain pp. 226-239. ISSN 1868-8969. ISBN 978-3-939897-91-0.      (2015)  
relation: http://drops.dagstuhl.de/opus/volltexte/2015/5368
relation: 10.4230/LIPIcs.CONCUR.2015.226