Parallel parameter synthesis algorithm for hybrid CTL

N. Beneš, L. Brim, S. Pastva, D. Šafránek
Science of Computer Programming, Volume 185, 1 January 2020, 102321

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.

Cite this article as: N. Beneš, L. Brim, S. Pastva, D. Šafránek. Parallel parameter synthesis algorithm for hybrid CTL. Science of Computer Programming, Volume 185, 1 January 2020. https://doi.org/10.1016/j.scico.2019.102321
Top