An undecidable problem for timed automata

被引：4
|
作者：
Puri, A [1 ]
机构：
[1] AT&T Bell Labs, Murray Hill, NJ 07974 USA
来源：
DISCRETE EVENT DYNAMIC SYSTEMS-THEORY AND APPLICATIONS | 1999年 / 9卷 / 02期
关键词：
timed systems; hybrid systems; decidability;
D O I：
10.1023/A:1008319830371
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The reachability problem for timed automata is decidable when the coefficients in the guards are rational numbers. We show that the reachability problem is undecidable when the coefficients are chosen from the set {1, root 2}. A consequence of this is that the parameter synthesis problem for timed automata with even a single parameter is undecidable. We discuss why such undecidability results arise in timed and hybrid systems, what they mean, and if it is possible to "get around" them.
引用
收藏
页码：135 / 146
页数：12
相关论文
共 50 条
  • [21] Axiomatising timed automata
    Huimin Lin
    Wang Yi
    Acta Informatica, 2002, 38 : 277 - 305
  • [22] Updatable timed automata
    Bouyer, P
    Dufourd, C
    Fleury, E
    Petit, A
    THEORETICAL COMPUTER SCIENCE, 2004, 321 (2-3) : 291 - 345
  • [23] Robust timed automata
    Gupta, V
    Henzinger, TA
    Jagadeesan, R
    HYBRID AND REAL-TIME SYSTEMS, 1997, 1201 : 331 - 345
  • [24] THE THEORY OF TIMED AUTOMATA
    ALUR, R
    DILL, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 600 : 45 - 73
  • [25] On interleaving in timed automata
    Ben Salah, Ramzi
    Bozga, Marius
    Maler, Oded
    CONCUR 2006 - CONCURRENCY THEORY, PROCEEDINGS, 2006, 4137 : 465 - 476
  • [26] On probabilistic timed automata
    Beauquier, D
    THEORETICAL COMPUTER SCIENCE, 2003, 292 (01) : 65 - 84
  • [27] Untameable timed automata!
    Bouyer, P
    STACS 2003, PROCEEDINGS, 2003, 2607 : 620 - 631
  • [28] Shrinking timed automata
    Sankur, Ocan
    Bouyer, Patricia
    Markey, Nicolas
    INFORMATION AND COMPUTATION, 2014, 234 : 107 - 132
  • [29] Minimizable timed automata
    Springintveld, J.
    Vaandrager, F.
    Lecture Notes in Computer Science, 1135
  • [30] Robustness in Timed Automata
    Bouyer, Patricia
    Markey, Nicolas
    Sankur, Ocan
    REACHABILITY PROBLEMS, 2013, 8169 : 1 - 18
12345