The surprising robustness of (closed) timed automata against clock-drift (original) (raw)
Related papers
Determinisability of one-clock timed automata
2020
Timed Automata with Asynchronous Processes: Schedulability and Decidability
2002
Model checking via reachability testing for timed automata
Timed Automata with Integer Resets: Language Inclusion and Expressiveness
Lecture Notes in Computer Science
Bounded Determinization of Timed Automata with Silent Transitions
Lecture Notes in Computer Science, 2015
A symbolic decision procedure for robust safety of timed systems
2007
Reachability of Communicating Timed Processes
Lecture Notes in Computer Science, 2013
Comparing timed c/e systems with timed automata (abstract)
Lecture Notes in Computer Science, 1997
Decidability of Timed Communicating Automata
ArXiv, 2018
Multi-Core Reachability for Timed Automata
2012
Reachability Preservation Based Parameter Synthesis for Timed Automata
Lecture Notes in Computer Science, 2015
Counter-Free Input-Determined Timed Automata
Lecture Notes in Computer Science, 2007
Repairing Timed Automata Clock Guards through Abstraction and Testing
Tests and Proofs, 2019
On Continuous Timed Automata with Input-Determined Guards
Lecture Notes in Computer Science, 2006
From Timed Automata to Logic - and Back
BRICS Report Series, 1995
Reachability-time games on timed automata
2007
Closed, open, and robust timed networks
Electronic Notes in Theoretical …, 2005
Parametric Model Checking Timed Automata Under Non-Zenoness Assumption
Lecture Notes in Computer Science, 2017
Reducing Quasi-equal Clocks in Networks of Timed Automata
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science, 2004
Performance analysis of probabilistic timed automata using digital clocks
Formal Methods in System Design, 2006
The Power of Reachability Testing for Timed Automata
Lecture Notes in Computer Science, 1998
Timed Automata with non-Instantaneous Actions
Fundamenta Informaticae, 2001