On Approximative Reachability Analysis of Biochemical Dynamical Systems

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F12%3A00057894" target="_blank" >RIV/00216224:14330/12:00057894 - isvavai.cz</a>

Výsledek na webu

<a href="http://link.springer.com/chapter/10.1007%2F978-3-642-35524-0_4" target="_blank" >http://link.springer.com/chapter/10.1007%2F978-3-642-35524-0_4</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-642-35524-0_4" target="_blank" >10.1007/978-3-642-35524-0_4</a>

Jazyk výsledku

angličtina

Název v původním jazyce

On Approximative Reachability Analysis of Biochemical Dynamical Systems

Popis výsledku v původním jazyce

This is an extended version of the workshop paper, in which a new computational technique called quantitative discrete approximation has been introduced. The technique provides finite discrete approximation of continuous dynamical systems which is suitable especially for a significant class of biochemical dynamical systems. With decreasing granularity the approximation of behaviour between a discrete state and its successor converges to the behaviour of the original continuous system in the respective part of the phase space. This paper provides a detailed description of the method and algorithms solving the reachability problem in biochemical dynamical systems. The method is supplemented with heuristics for reducing the cardinality of the reachable state space. The algorithms are evaluated on six models (with numbers of variables ranging from 2 to 12).

Název v anglickém jazyce

On Approximative Reachability Analysis of Biochemical Dynamical Systems

Popis výsledku anglicky

This is an extended version of the workshop paper, in which a new computational technique called quantitative discrete approximation has been introduced. The technique provides finite discrete approximation of continuous dynamical systems which is suitable especially for a significant class of biochemical dynamical systems. With decreasing granularity the approximation of behaviour between a discrete state and its successor converges to the behaviour of the original continuous system in the respective part of the phase space. This paper provides a detailed description of the method and algorithms solving the reachability problem in biochemical dynamical systems. The method is supplemented with heuristics for reducing the cardinality of the reachable state space. The algorithms are evaluated on six models (with numbers of variables ranging from 2 to 12).

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GAP202%2F11%2F0312" target="_blank" >GAP202/11/0312: Vývoj a verifikace softwarových komponent v zapouzdřených systémech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Transactions on Computational Systems Biology XIV

ISBN

9783642355233

ISSN

0302-9743

e-ISSN

—

Počet stran výsledku

25

Strana od-do

77-101

Název nakladatele

Springer

Místo vydání

Heidelberg

Místo konání akce

Aachen

Datum konání akce

1. 1. 2012

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—