On Algorithmic Analysis of Transcriptional Regulation by LTL Model Checking

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F09%3A00029225" target="_blank" >RIV/00216224:14330/09:00029225 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On Algorithmic Analysis of Transcriptional Regulation by LTL Model Checking
Original language description
This paper is focused on the model checking approach for analysis of piecewise-linear deterministic models of genetic regulatory networks. Firstly, the qualitative simulation algorithm of de Jong et.al. that builds the heart of Genetic Network Analyzer (GNA) is revisited and its time complexity is studied in detail. Secondly, a novel algorithm that reduces the state space generation time is introduced. The new algorithm is developed as an abstraction of the original GNA algorithm. Finally, a fragment oflinear time temporal logic for which the provided abstraction is conservative is identified. Efficiency of the new algorithm when implemented in the parallel model checking environment is demonstrated on a set of experiments performed on randomly modified biological models. In general, the achieved results bring a new insight into the field of qualitative simulation emerging in the context of systems biology.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/GA201%2F09%2F1389" target="_blank" >GA201/09/1389: Verification and Analysis of Large-Scale Computer Systems</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

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

Similar results(10)