Milan Češka1,2, Frits Dannenberg1, Marta Kwiatkowska1, Nicola Paoletti1
1 - Department of Computer Science, University of Oxford, UK
2 - Faculty of Informatics, Masaryk University, Czech Republic
We consider the problem of synthesising rate parameters for stochastic biochemical networks so that a given CSL time-bounded property is guaranteed to hold, or, in the case of quantitative properties, the probability of satisfying the property is maximised/minimised. We develop algorithms based on the parameter exploration methods of [6], in conjunction with refinement and sampling, which yield answers that are precise to within an arbitrarily small tolerance value. Our methods are efficient and improve on techniques of [10] for approximate parameter synthesis that employ discretisation and refinement. We evaluate the usefulness of the methods by synthesising rates for two biologically motivated case studies, including the reliability analysis of a DNA walker.
This Website by Pedro Mendes is licensed under a Creative Commons Attribution 4.0 International License. This page uses the Perfect 'Left Menu' 2 Column Liquid Layout.