Timed and Probabilistic Model Checking over Phylogenetic Trees

被引:1
|
作者
Ignacio Requeno, Jose [1 ]
Manuel Colom, Jose [1 ]
机构
[1] Univ Zaragoza, Dept Comp Sci & Syst Engn DIIS, Zaragoza 50018, Spain
关键词
phylogenetic analysis; timed & probabilistic model checking;
D O I
10.1007/978-3-319-07581-5_13
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Model checking is a generic verification technique that allows the phylogeneticist to focus on models and specifications instead of on implementation issues. Phylogenetic trees are considered as transition systems over which we interrogate phylogenetic questions written as formulas of temporal logic. Nonetheless, standard logics become insufficient for the usual practices of phylogenetic analysis since they don't allow the inclusion of explicit time and probabilities. The aim of this paper is to extend the application of model checking techniques beyond qualitative phylogenetic properties and adapt the existing logical extensions and tools to the field of phylogeny. The introduction of time and probabilities in phylogenetic specifications is motivated by a real example.
引用
收藏
页码:105 / 112
页数:8
相关论文
共 50 条
  • [1] Analyzing Phylogenetic Trees with Timed and Probabilistic Model Checking: The Lactose Persistence Case Study
    Ignacio Requeno, Jose
    Manuel Colom, Jose
    [J]. JOURNAL OF INTEGRATIVE BIOINFORMATICS, 2014, 11 (03) : 248
  • [2] Model checking for probabilistic timed automata
    Gethin Norman
    David Parker
    Jeremy Sproston
    [J]. Formal Methods in System Design, 2013, 43 : 164 - 190
  • [3] Model checking for probabilistic timed automata
    Norman, Gethin
    Parker, David
    Sproston, Jeremy
    [J]. FORMAL METHODS IN SYSTEM DESIGN, 2013, 43 (02) : 164 - 190
  • [4] Model checking for probabilistic timed systems
    Sproston, J
    [J]. VALIDATION OF STOCHASTIC SYSTEMS: A GUIDE TO CURRENT RESEARCH, 2004, 2925 : 189 - 229
  • [5] Symbolic model checking for probabilistic timed automata
    Kwiatkowska, M
    Norman, G
    Sproston, J
    Wang, FZ
    [J]. FORMAL TECHNIQUES, MODELLING AND ANALYSIS OF TIMED AND FAULT-TOLERANT SYSTEMS, PROCEEDINGS, 2004, 3253 : 293 - 308
  • [6] Symbolic model checking for probabilistic timed automata
    Kwiatkowska, Marta
    Norman, Gethin
    Sproston, Jeremy
    Wang, Fuzhi
    [J]. INFORMATION AND COMPUTATION, 2007, 205 (07) : 1027 - 1077
  • [7] Counterexample generation for probabilistic timed automata model checking
    Department of Computer Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
    [J]. Jisuanji Yanjiu yu Fazhan, 2008, 10 (1638-1645):
  • [8] Model checking probabilistic timed automata in the presence of uncertainties
    Zhang, Junhua
    Huang, Zhiqiu
    Cao, Zining
    Xiao, Fangxiong
    [J]. Journal of Computational Information Systems, 2010, 6 (07): : 2231 - 2243
  • [9] MODEL CHECKING PROBABILISTIC TIMED AUTOMATA WITH ONE OR TWO CLOCKS
    Jurdzinski, Marcin
    Laroussinie, Francois
    Sproston, Jeremy
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2008, 4 (03)
  • [10] An Experiment on Decision Diagrams for Model Checking Probabilistic Timed Automata
    Ji, Wei
    Wang, Farn
    Wu, Peng
    Lv, Yi
    [J]. 2016 21ST INTERNATIONAL CONFERENCE ON ENGINEERING OF COMPLEX COMPUTER SYSTEMS (ICECCS 2016), 2016, : 111 - 121