Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
On conciseness of extensions of timed automata
Journal of Automata, Languages and Combinatorics
Robust safety of timed automata
Formal Methods in System Design
Dynamical properties of timed automata revisited
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Probabilistic and topological semantics for timed automata
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Robust analysis of timed automata via channel machines
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Implementation of timed automata: an issue of semantics or modeling?
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Robustness of time petri nets under guard enlargement
RP'12 Proceedings of the 6th international conference on Reachability Problems
Information and Computation
Hi-index | 0.00 |
Timed automata are a model that is extensively used in formal verification of real-time systems. However, their mathematical semantics is an idealization which assumes perfectly precise clocks, but does not correspond to real hardware. In fact, it is known that imprecisions, however small they may be, may yield extra behaviours. Several works concentrated on a relaxation of the semantics of timed automata to model the imprecisions of the clocks. Algorithms were given, first for safety, then for richer linear-time properties, to decide the robustness of timed systems, that is, the existence of a bound on the imprecisions under which the system satisfies a given property. In this work, we study a stronger notion of robustness: we show how to decide whether the untimed language of a timed automaton is preserved under small enough imprecisions, and provide a bound on the imprecision parameter.