Theoretical Computer Science
Analysis of Timed Systems Using Time-Abstracting Bisimulations
Formal Methods in System Design
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
A Comparison of Control Problems for Timed and Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Two examples of verification of multirate timed automata with Kronos
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Robust safety of timed automata
Formal Methods in System Design
Model-based implementation of real-time applications
EMSOFT '10 Proceedings of the tenth ACM international conference on Embedded software
Robust model-checking of timed automata via pumping in channel machines
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
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
The embedded systems design challenge
FM'06 Proceedings of the 14th international conference on Formal Methods
Robust reachability in timed automata: a game-based approach
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
We present a tool for the robustness analysis of timed automata that can check whether a given time-abstract behaviour of a timed automaton is still present when the guards are perturbed. The perturbation model we consider is shrinking, which corresponds to increasing lower bounds and decreasing upper bounds in the clock guards by parameters. The tool synthesizes these parameters for which the given behaviour is preserved in the new automaton if possible, and generates a counter-example otherwise. This can be used for 1) robustness analysis, and for 2) deriving implementations under imprecisions.