Specifying real-time properties with metric temporal logic
Real-Time Systems
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Dynamical Properties of Timed Automata
FTRTFT '98 Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant 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
Kronos: A Model-Checking Tool for Real-Time Systems
CAV '98 Proceedings of the 10th 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
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A Symbolic Decision Procedure for Robust Safety of Timed Systems
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
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
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
Symbolic robustness analysis of timed automata
FORMATS'06 Proceedings of the 4th 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
Timed Parity Games: Complexity and Robustness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Robust safety of timed automata
Formal Methods in System Design
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
Quantitative robustness analysis of flat timed automata
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Untimed language preservation in timed systems
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Timed automata can always be made implementable
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
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
Robust specification of real time components
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
Robustness of time petri nets under guard enlargement
RP'12 Proceedings of the 6th international conference on Reachability Problems
Information and Computation
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
Hi-index | 0.00 |
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Several works have thus focused on a modified semantics of timed automata which ensures implementability, and robust model-checking algorithms for safety, and later LTL properties have been designed. Recently, a new approach has been proposed, which reduces (standard) model-checking of timed automata to other verification problems on channel machines. Thanks to a new encoding of the modified semantics as a network of timed systems, we propose an original combination of both approaches, and prove that robust model-checking for coFlat-MTL, a large fragment of MTL, is EXPSPACE-Complete.