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 条
  • [1] Revisiting reachability in Polynomial Interrupt Timed Automata
    Berard, Beatrice
    Haddad, Serge
    INFORMATION PROCESSING LETTERS, 2022, 174
  • [2] Revisiting reachability in polynomial interrupt timed automata (vol 174, 106208, 2022)
    Berard, Beatrice
    Haddad, Serge
    INFORMATION PROCESSING LETTERS, 2022, 175
  • [3] Revisiting Reachability in Timed Automata
    Quaas, Karin
    Shirmohammadi, Mahsa
    Worrell, James
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [4] Polynomial interrupt timed automata: Verification and expressiveness
    Berard, B.
    Haddad, S.
    Picaronny, C.
    El Din, M. Safey
    Sassolas, M.
    INFORMATION AND COMPUTATION, 2021, 277
  • [5] Interrupt Timed Automata
    Berard, Beatrice
    Haddad, Serge
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, PROCEEDINGS, 2009, 5504 : 197 - +
  • [6] Revisiting Bounded Reachability Analysis of Timed Automata Based on MILP
    Ober, Iulian
    FORMAL METHODS FOR INDUSTRIAL CRITICAL SYSTEMS, FMICS 2018, 2018, 11119 : 269 - 283
  • [7] Parametric Interrupt Timed Automata
    Berard, Beatrice
    Haddad, Serge
    Jovanovic, Aleksandra
    Lime, Didier
    REACHABILITY PROBLEMS, 2013, 8169 : 59 - 69
  • [8] Revisiting Decidability and Optimum Reachability for Multi-Priced Timed Automata
    Fraezle, Martin
    Swaminathan, Mani
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS, PROCEEDINGS, 2009, 5813 : 149 - 163
  • [9] Interrupt Timed Automata: verification and expressiveness
    Béatrice Bérard
    Serge Haddad
    Mathieu Sassolas
    Formal Methods in System Design, 2012, 40 : 41 - 87
  • [10] Interrupt Timed Automata: verification and expressiveness
    Berard, Beatrice
    Haddad, Serge
    Sassolas, Mathieu
    FORMAL METHODS IN SYSTEM DESIGN, 2012, 40 (01) : 41 - 87
12345