Timed Petri nets and timed automata: On the discriminating power of zeno sequences
Information and Computation
ACM Transactions on Computational Logic (TOCL)
Timed Automata with Integer Resets: Language Inclusion and Expressiveness
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Determinization and Expressiveness of Integer Reset Timed Automata with Silent Transitions
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Weak Alternating Timed Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Robustness of temporal logic specifications for continuous-time signals
Theoretical Computer Science
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Realizability of Real-Time Logics
FORMATS '09 Proceedings of the 7th International Conference on Formal Modeling and Analysis of Timed Systems
On sampling abstraction of continuous time logic with durations
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Time and alternation: an automata based framework to software model checking
Proceedings of the 2010 ACM Symposium on Applied Computing
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Counter-free input-determined timed automata
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
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
Towards a theory of time-bounded verification
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
From MTL to deterministic timed automata
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
Timed Modal Logics for Real-Time Systems
Journal of Logic, Language and Information
Emptiness and universality problems in timed automata with positive frequency
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
On construction of safety signal automata for MITL[ u, s] using temporal projections
FORMATS'11 Proceedings of the 9th international conference on Formal modeling and analysis of timed systems
On continuous timed automata with input-determined guards
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On metric temporal logic and faulty turing machines
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Real time temporal logic: past, present, future
FORMATS'05 Proceedings of the Third international conference on Formal Modeling and Analysis of Timed Systems
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Temporal logic verification using simulation
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
A dose of timed logic, in guarded measure
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
On the expressiveness of MTL with past operators
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Controller synthesis for MTL specifications
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Timed temporal logics for abstracting transient states
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Robustness of temporal logic specifications
FATES'06/RV'06 Proceedings of the First combined international conference on Formal Approaches to Software Testing and Runtime Verification
Robust model-checking of linear-time properties in timed automata
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Safety metric temporal logic is fully decidable
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Behavioral interface specification languages
ACM Computing Surveys (CSUR)
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
ICFEM'12 Proceedings of the 14th international conference on Formal Engineering Methods: formal methods and software engineering
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
On MITL and alternating timed automata
FORMATS'13 Proceedings of the 11th international conference on Formal Modeling and Analysis of Timed Systems
Specifying safety-critical systems with a decidable duration logic
Science of Computer Programming
Hi-index | 0.00 |
Metric Temporal Logic (MTL) is a prominent specification formalism for real-time systems. In this paper, we show that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity. We also consider the model-checking problem for MTL: whether all words accepted by a given Alur-Dill timed automaton satisfy a given MTL formula. We show that this problem is decidable over finite words. Over infinite words, we show that model checking the safety fragment of MTL--which includes invariance and time-bounded response properties--is also decidable. These results are quite surprising in that they contradict various claims to the contrary that have appeared in the literature. The question of the decidability of MTL over infinite words remains open.