Robustness in Timed Automata

被引:0
|
作者
Bouyer, Patricia [1 ]
Markey, Nicolas [1 ]
Sankur, Ocan [1 ]
机构
[1] CNRS, LSV, F-75700 Paris, France
来源
REACHABILITY PROBLEMS | 2013年 / 8169卷
关键词
DYNAMICAL PROPERTIES; MODEL-CHECKING; IMPLEMENTATION; SEMANTICS;
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper we survey several approaches to the robustness of timed automata, that is, the ability of a system to resist to slight perturbations or errors. We will concentrate on robustness against timing errors which can be due to measuring errors, imprecise clocks, and unexpected runtime behaviors such as execution times that are longer or shorter than expected. We consider the perturbation model of guard enlargement and formulate several robust verification problems that have been studied recently, including robustness analysis, robust implementation, and robust control.
引用
收藏
页码:1 / 18
页数:18
相关论文
共 50 条
  • [1] Quantitative Robustness Analysis of Flat Timed Automata
    Jaubert, Remi
    Reynier, Pierre-Alain
    FOUNDATIONS OF SOFTWARE SCIENCE AND COMPUTATIONAL STRUCTURES, 2011, 6604 : 229 - +
  • [2] Shrinking timed automata
    Sankur, Ocan
    Bouyer, Patricia
    Markey, Nicolas
    INFORMATION AND COMPUTATION, 2014, 234 : 107 - 132
  • [3] Shrinking Timed Automata
    Sankur, Ocan
    Bouyer, Patricia
    Markey, Nicolas
    IARCS ANNUAL CONFERENCE ON FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE (FSTTCS 2011), 2011, 13 : 90 - 102
  • [4] STOCHASTIC TIMED AUTOMATA
    Bertrand, Nathalie
    Bouyer, Patricia
    Brihaye, Thomas
    Menet, Quentin
    Baier, Christel
    Groesser, Marcus
    Jurdzinski, Marcin
    LOGICAL METHODS IN COMPUTER SCIENCE, 2014, 10 (04)
  • [5] On probabilistic timed automata
    Beauquier, D
    THEORETICAL COMPUTER SCIENCE, 2003, 292 (01) : 65 - 84
  • [6] The Timestamp of Timed Automata
    Rosenmann, Amnon
    FORMAL MODELING AND ANALYSIS OF TIMED SYSTEMS (FORMATS 2019), 2019, 11750 : 181 - 198
  • [7] A Menagerie of Timed Automata
    Fontana, Peter
    Cleaveland, Rance
    ACM COMPUTING SURVEYS, 2014, 46 (03)
  • [8] On Implementable Timed Automata
    Feo-Arenis, Sergio
    Vujinovic, Milan
    Westphal, Bernd
    FORMAL TECHNIQUES FOR DISTRIBUTED OBJECTS, COMPONENTS, AND SYSTEMS, FORTE 2020, 2020, 12136 : 78 - 95
  • [9] A Symbolic Algorithm for the Analysis of Robust Timed Automata
    Kordy, Piotr
    Langerak, Rom
    Mauw, Sjouke
    Polderman, Jan Willem
    FM 2014: FORMAL METHODS, 2014, 8442 : 351 - 366
  • [10] Revisiting Reachability in Timed Automata
    Quaas, Karin
    Shirmohammadi, Mahsa
    Worrell, James
    2017 32ND ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2017,