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 条
  • [31] Concuffency in timed automata
    Lanotte, R
    Maggiolo-Schettini, A
    Tini, S
    THEORETICAL COMPUTER SCIENCE, 2003, 309 (1-3) : 503 - 527
  • [32] Timed P Automata
    Barbuti, Roberto
    Maggiolo-Schettini, Andrea
    Milazzo, Paolo
    Tesei, Luca
    FUNDAMENTA INFORMATICAE, 2009, 94 (01) : 1 - 19
  • [33] Testing timed automata
    Springintveld, J
    Vaandrager, F
    D'Argenio, PR
    THEORETICAL COMPUTER SCIENCE, 2001, 254 (1-2) : 225 - 257
  • [34] Eventual timed automata
    D'Souza, D
    Mohan, MR
    FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 322 - 334
  • [35] The Timestamp of Timed Automata
    Rosenmann, Amnon
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2019), 2019, 11750 : 181 - 198
  • [36] Testingmembership for timed automata
    Lassaigne, Richard
    de Rougemont, Michel
    ACTA INFORMATICA, 2023, 60 (04) : 361 - 384
  • [37] Perturbed timed automata
    Alur, R
    La Torre, S
    Madhusudan, P
    HYBRID SYSTEMS: COMPUTATION AND CONTROL, 2005, 3414 : 70 - 85
  • [38] The Opacity of Timed Automata
    An, Jie
    Gao, Qiang
    Wang, Lingtai
    Zhan, Naijun
    Hasuo, Ichiro
    FORMAL METHODS, PT I, FM 2024, 2025, 14933 : 620 - 637
  • [39] A Menagerie of Timed Automata
    Fontana, Peter
    Cleaveland, Rance
    ACM COMPUTING SURVEYS, 2014, 46 (03)
  • [40] Timed cooperating automata
    Lanotte, Ruggero
    Maggiolo-Schettin, Andrea
    Peron, Adriano
    Fundamenta Informaticae, 2000, 43 (01) : 153 - 173
12345