Bisimulation through probabilistic testing (preliminary report)
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Dynamical Properties of Timed Automata
Discrete Event Dynamic Systems
On Discretization of Delays in Timed Automata and Digital Circuits
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Timing Assumptions and Verification of Finite-State Concurrent Systems
Proceedings of the International Workshop on Automatic Verification Methods for Finite State 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
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Some Progress in the Symbolic Verification of Timed Automata
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Revisiting Digitization, Robustness, and Decidability for Timed Automata
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Almost ASAP semantics: from timed models to timed implementations
Formal Aspects of Computing
Robust safety of timed automata
Formal Methods in System Design
Discounting the future in systems theory
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
Quantifying similarities between timed systems
FORMATS'05 Proceedings of the Third 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
On sampled semantics of timed systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Precise robustness analysis of time petri nets with inhibitor arcs
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Robust synthesis for real-time systems
Theoretical Computer Science
Information and Computation
| Hi-index | 0.00 |
Timed automata follow a mathematical semantics, which assumes perfect precision and synchrony of clocks. Since this hypothesis does not hold in digital systems, properties proven formally on a timed automaton may be lost at implementation. In order to ensure implementability, several approaches have been considered, corresponding to different hypotheses on the implementation platform. We address two of these: A timed automaton is samplable if its semantics is preserved under a discretization of time; it is robust if its semantics is preserved when all timing constraints are relaxed by some small positive parameter. We propose a construction which makes timed automata implementable in the above sense: From any timed automaton A, we build a timed automaton A′ that exhibits the same behaviour as A, and moreover A′ is both robust and samplable by construction.