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 条
  • [21] Interrupt Timed Automata with Auxiliary Clocks and Parameters
    Berard, Beatrice
    Haddad, Serge
    Jovanovic, Aleksandra
    Lime, Didier
    FUNDAMENTA INFORMATICAE, 2016, 143 (3-4) : 235 - 259
  • [22] Polynomial Distinguishability of Timed Automata
    Verwer, Sicco
    de Weerdt, Mathijs
    Witteveen, Cees
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2008, 5278 : 238 - 251
  • [23] On the optimal reachability problem of weighted timed automata
    Bouyer, Patricia
    Brihaye, Thomas
    Bruyere, Veronique
    Raskin, Jean-Francois
    FORMAL METHODS IN SYSTEM DESIGN, 2007, 31 (02) : 135 - 175
  • [24] Relating Reachability Problems in Timed and Counter Automata
    Haase, Christoph
    Ouaknine, Joel
    Worrell, James
    FUNDAMENTA INFORMATICAE, 2016, 143 (3-4) : 317 - 338
  • [25] On the optimal reachability problem of weighted timed automata
    Patricia Bouyer
    Thomas Brihaye
    Véronique Bruyère
    Jean-François Raskin
    Formal Methods in System Design, 2007, 31 : 135 - 175
  • [26] Symbolic Optimal Reachability in Weighted Timed Automata
    Bouyer, Patricia
    Colange, Maximilien
    Markey, Nicolas
    COMPUTER AIDED VERIFICATION, (CAV 2016), PT I, 2016, 9779 : 513 - 530
  • [27] Effective definability of the reachability relation in timed automata
    Fraenzle, Martin
    Quaas, Karin
    Shirmohammadi, Mahsa
    Worrell, James
    INFORMATION PROCESSING LETTERS, 2020, 153
  • [28] Revisiting Timed Logics with Automata Modalities
    Ho, Hsi-Ming
    PROCEEDINGS OF THE 2019 22ND ACM INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL (HSCC '19), 2019, : 67 - 76
  • [29] Lazy Reachability Checking for Timed Automata with Discrete Variables
    Toth, Tamas
    Majzik, Istvan
    MODEL CHECKING SOFTWARE, SPIN 2018, 2018, 10869 : 235 - 254
  • [30] Reachability results for timed automata with unbounded data structures
    Ruggero Lanotte
    Andrea Maggiolo-Schettini
    Angelo Troina
    Acta Informatica, 2010, 47 : 279 - 311
12345