David Šafránek
Masaryk University
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by David Šafránek.
IEEE/ACM Transactions on Computational Biology and Bioinformatics | 2012
Jiri Barnat; Luboš Brim; Adam Krejci; Adam Streck; David Šafránek; Martin Vejnar; Tomáš Vejpustek
An important problem in current computational systems biology is to analyze models of biological systems dynamics under parameter uncertainty. This paper presents a novel algorithm for parameter synthesis based on parallel model checking. The algorithm is conceptually universal with respect to the modeling approach employed. We introduce the algorithm, show its scalability, and examine its applicability on several biological models.
computer aided verification | 2013
Luboš Brim; Milan Češka; Sven Dražan; David Šafránek
We propose an automated method for exploring kinetic parameters of stochastic biochemical systems. The main question addressed is how the validity of an a priori given hypothesis expressed as a temporal logic property depends on kinetic parameters. Our aim is to compute a landscape function that, for each parameter point from the inspected parameter space, returns the quantitative model checking result for the respective continuous time Markov chain. Since the parameter space is in principle dense, it is infeasible to compute the landscape function directly. Hence, we design an effective method that iteratively approximates the lower and upper bounds of the landscape function with respect to a given accuracy. To this end, we modify the standard uniformization technique and introduce an iterative parameter space decomposition. We also demonstrate our approach on two biologically motivated case studies.
formal methods | 2013
Luboš Brim; Milan Češka; David Šafránek
Model checking together with other formal methods and techniques is being adapted for applications to biological systems. We present a selection of approaches used for modeling biological systems and formalizing their interesting properties in temporal logics. We also give a brief account of high performance model checking techniques and add a few case studies that demonstrate the use of model checking in computational systems biology. The primary aim is to give a reference for further reading.
Information & Computation | 2014
Luboš Brim; Petr Dluhoš; David Šafránek; Tomáš Vejpustek
To express temporal properties of dense-time real-valued signals, the Signal Temporal Logic (STL) has been defined by Maler et al. The work presented a monitoring algorithm deciding the satisfiability of STL formulae on finite discrete samples of continuous signals. The logic is not expressive enough to sufficiently distinguish oscillatory properties important in biology. In this paper we introduce the extended logic STL* in which STL is augmented with a signal-value freezing operator allowing to express (and distinguish) various dynamic aspects of oscillations. This operator may be nested for further increase of expressiveness. The logic is supported by a monitoring algorithm prototyped in Matlab for the fragment that avoids nesting of the freezing operator. The monitoring procedure for STL* is evaluated on a sample oscillatory signal with varied parameters. Application of the extended logic is demonstrated on a case study of a biological oscillator. We also discuss expressive power of STL with respect to STL*.
computational methods in systems biology | 2012
Hannes Klarner; Adam Streck; David Šafránek; Juraj Kolčák; Heike Siebert
We propose a new methodology for identification and analysis of discrete gene networks as defined by Rene Thomas, supported by a tool chain: (i) given a Thomas network with partially known kinetic parameters, we reduce the number of acceptable parametrizations to those that fit time-series measurements and reflect other known constraints by an improved technique of coloured LTL model checking performing efficiently on Thomas networks in distributed environment; (ii) we introduce classification of acceptable parametrizations to identify most optimal ones; (iii) we propose two ways of visualising parametrizations dynamics wrt time-series data. Finally, computational efficiency is evaluated and the methodology is validated on bacteriophage λ case study.
BioSystems | 2011
David Šafránek; Jan Červený; Matej Klement; Jana Pospíšilová; Luboš Brim; Dušan Lazár; Ladislav Nedbal
E-photosynthesis framework is a web-based platform for modeling and analysis of photosynthetic processes. Compared to its earlier version, the present platform employs advanced software methods and technologies to support an effective implementation of vastly diverse kinetic models of photosynthesis. We report on the first phase implementation of the tool new version and demonstrate the functionalities of model visualization, presentation of model components, rate constants, initial conditions and of model annotation. The demonstration also includes export of a model to the Systems Biology Markup Language format and remote numerical simulation of the model.
COMPMOD | 2009
Jiří Barnat; Luboš Brim; Ivana Černá; Sven Dražan; Jana Fabriková; Jan Láník; David Šafránek; Ma Hongwu
In this paper a novel tool BioDiVinE for parallel analysis of biological models is presented. The tool allows analysis of biological models specified in terms of a set of chemical reactions. Chemical reactions are transformed into a system of multi-affine differential equations. BioDiVinE employs techniques for finite discrete abstraction of the continuous state space. At that level, parallel analysis algorithms based on model checking are provided. In the paper, the key tool features are described and their application is demonstrated by means of a case study.
Electronic Proceedings in Theoretical Computer Science | 2012
Petr Dluhoš; Luboš Brim; David Šafránek
To express temporal properties of dense-time real-valued signals, the Signal Temporal Logic (STL) has been defined by Maler et al. The work presented a monitoring algorithm deciding the satisfiability of STL formulae on finite discrete samples of continuous signals. The logic has been used to express and analyse biological systems, but it is not expressive enough to sufficiently distinguish oscillatory properties important in biology. In this paper we define the extended logic STL* in which STL is augmented with a signal-value freezing operator allowing us to express (and distinguish) detailed properties of biological oscillations. The logic is supported by a monitoring algorithm prototyped in Matlab. The monitoring procedure of STL* is evaluated on a biologically-relevant case study.
arXiv: Logic in Computer Science | 2013
Luboš Brim; Tomáš Vejpustek; David Šafránek; Jana Fabriková
In our previous work we have introduced the logic STL*, an extension of Signal Temporal Logic (STL) that allows value freezing. In this paper, we define robustness measures for STL* by adapting the robustness measures previously introduced for Metric Temporal Logic (MTL). Furthermore, we present an algorithm for STL* robustness computation, which is implemented in the tool Parasim. Application of STL* robustness analysis is demonstrated on case studies.
computational methods in systems biology | 2015
Luboš Brim; Milan Češka; Martin Demko; Samuel Pastva; David Šafránek
We propose a new distributed-memory parallel algorithm for parameter synthesis from CTL hypotheses. The algorithm colours the state space transitions by different parameterisations and extends CTL model checking to identify the maximal set of parameters that guarantee the satisfaction of the given CTL property. We experimentally confirm good scalability of our approach and demonstrate its applicability in the case study of a genetic switch controlling decisions in the cell cycle.