Revisiting reachability in Polynomial Interrupt Timed Automata

被引：0
|
作者：
Bérard, Béatrice [1 ]
Haddad, Serge [2 ]
机构：
[1] Sorbonne Université, CNRS, LIP6, Paris,F-75005, France
[2] LSV, ENS Paris-Saclay, CNRS, Inria, Université Paris, Saclay, France
来源：
Information Processing Letters | 2022年 / 174卷
关键词：
14;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] A Refined Algorithm for Reachability Analysis of Updatable Timed Automata
    Fang, Bingbing
    Li, Guoqiang
    Fang, Ling
    Xiang, Jianwen
    2015 IEEE INTERNATIONAL CONFERENCE ON SOFTWARE QUALITY, RELIABILITY AND SECURITY - COMPANION (QRS-C 2015), 2015, : 230 - 236
  • [42] Configuration reachability analysis of synchronized recursive timed automata
    Uezato Y.
    Minamide Y.
    2018, Japan Society for Software Science and Technology (35) : 140 - 168
  • [43] Revisiting digitization, robustness, and decidability for timed automata
    Ouaknine, J
    Worrell, J
    18TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2003, : 198 - 207
  • [44] Pareto Optimal Reachability Analysis for Simple Priced Timed Automata
    Zhang, Zhengkui
    Nielsen, Brian
    Larsen, Kim Guldstrand
    Nies, Gilles
    Stenger, Marvin
    Hermanns, Holger
    FORMAL METHODS AND SOFTWARE ENGINEERING, ICFEM 2017, 2017, 10610 : 481 - 495
  • [45] Robust Reachability in Timed Automata: A Game-Based Approach
    Bouyer, Patricia
    Markey, Nicolas
    Sankur, Ocan
    AUTOMATA, LANGUAGES, AND PROGRAMMING, ICALP 2012, PT II, 2012, 7392 : 128 - 140
  • [46] Reachability-time games on timed automata - (Extended abstract)
    Jurdzinski, Marcin
    Trivedi, Ashutosh
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 838 - +
  • [47] Pushdown timed automata: a binary reachability characterization and safety verification
    Zhe, D
    THEORETICAL COMPUTER SCIENCE, 2003, 302 (1-3) : 93 - 121
  • [48] Optimal-reachability and control for acyclic weighted timed automata
    La Torre, Salvatore
    Mukhopadhyay, Supratik
    Murano, Aniello
    IFIP Advances in Information and Communication Technology, 2002, 96 : 485 - 497
  • [49] Improved Undecidability Results for Reachability Games on Recursive Timed Automata
    Krishna, Shankara Narayanan
    Manasa, Lakshmi
    Trivedi, Ashutosh
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2014, (161): : 245 - 259
  • [50] Improvements in SAT-based reachability analysis for timed automata
    Zbrzezny, A
    FUNDAMENTA INFORMATICAE, 2004, 60 (1-4) : 417 - 434
12345