Computing reachability relations in timed automata

被引：11
|
作者：
Dima, C [1 ]
机构：
[1] Verimag, F-38610 Gieres, France
来源：
17TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS | 2002年
关键词：
D O I：
10.1109/LICS.2002.1029827
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We give an algorithmic calculus of the reachability relations on clock values defined by timed automata. Our approach is a modular one, by computing unions, compositions and reflexive-transitive closure (star) of "atomic" relations. The essential tool is a new representation technique for n-clock relations - the 2n-automata - and our strategy is to show the closure under union, composition and star of the class of 2n-automata that represent reachability relations in timed automata.
引用
收藏
页码：177 / 186
页数：10
相关论文
共 50 条
  • [1] Reachability relations of timed pushdown automata
    Clemente, Lorenzo
    Lasota, Slawomir
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2021, 117 : 202 - 241
  • [2] Revisiting Reachability in Timed Automata
    Quaas, Karin
    Shirmohammadi, Mahsa
    Worrell, James
    [J]. 2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,
  • [3] Distributed reachability analysis in timed automata
    Behrmann G.
    [J]. International Journal on Software Tools for Technology Transfer, 2005, 7 (1) : 19 - 30
  • [4] Computing Optimal Reachability Costs in Priced Dense-Timed Pushdown Automata
    Abdulla, Parosh Aziz
    Atig, Mohamed Faouzi
    Stenman, Jari
    [J]. LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS (LATA 2014), 2014, 8370 : 62 - 75
  • [5] The power of reachability testing for timed automata
    Aceto, L
    Bouyer, P
    Burgueño, A
    Larsen, KG
    [J]. FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, 1998, 1530 : 245 - 256
  • [6] Approximate reachability analysis of timed automata
    Balarin, F
    [J]. 17TH IEEE REAL-TIME SYSTEMS SYMPOSIUM, PROCEEDINGS, 1996, : 52 - 61
  • [7] Reachability Probabilities in Markovian Timed Automata
    Chen, Taolue
    Han, Tingting
    Katoen, Joost-Pieter
    Mereacre, Alexandru
    [J]. 2011 50TH IEEE CONFERENCE ON DECISION AND CONTROL AND EUROPEAN CONTROL CONFERENCE (CDC-ECC), 2011, : 7075 - 7080
  • [8] REACHABILITY AND LIVENESS IN PARAMETRIC TIMED AUTOMATA
    Andre, Etienne
    Lime, Didier
    Roux, Olivier H.
    [J]. LOGICAL METHODS IN COMPUTER SCIENCE, 2020, 18 (01)
  • [9] Robust parametric reachability for timed automata
    Doyen, Laurent
    [J]. INFORMATION PROCESSING LETTERS, 2007, 102 (05) : 208 - 213
  • [10] The power of reachability testing for timed automata
    Aceto, L
    Bouyer, P
    Burgueño, A
    Larsen, KG
    [J]. THEORETICAL COMPUTER SCIENCE, 2003, 300 (1-3) : 411 - 475
12345