Parallel parameter synthesis algorithm for hybrid CTL

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F20%3A00113986" target="_blank" >RIV/00216224:14330/20:00113986 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.scico.2019.102321" target="_blank" >http://dx.doi.org/10.1016/j.scico.2019.102321</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.scico.2019.102321" target="_blank" >10.1016/j.scico.2019.102321</a>

Result language
angličtina
Original language name
Parallel parameter synthesis algorithm for hybrid CTL
Original language description
Parametrised models of dynamical systems arise in various areas of science. In this work, we focus on models described as parametrised Kripke structures with properties formulated in a hybrid extension of the Computation Tree Logic. Our goal is to identify all the parametrisations under which the given model satisfies the properties. To that end, we propose a novel semi-symbolic parallel parameter synthesis algorithm. The algorithm is built on top of an existing approach that utilises the so-called Extended Dependency Graphs. We extend this approach to deal with parameters. To demonstrate the usefulness of our approach, we show its application to several case studies taken from systems biology.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)