Specifying real-time properties with metric temporal logic
Real-Time Systems
The temporal specification and verification of real-time systems
The temporal specification and verification of real-time systems
Journal of the ACM (JACM)
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Unreliable channels are easier to verify than perfect channels
Information and Computation
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Undecidable verification problems for programs with unreliable channels
Information and Computation
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Well-structured transition systems everywhere!
Theoretical Computer Science
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Regular Real-Time Languages
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
It's About Time: Real-Time Logics Reviewed
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata
ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
State Clock Logic: A Decidable Real-Time Logic
HART '97 Proceedings of the International Workshop on Hybrid and Real-Time Systems
Logics and Models of Real Time: A Survey
Proceedings of the Real-Time: Theory in Practice, REX Workshop
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Decidability and complexity results for timed automata via channel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
On Expressiveness and Complexity in Real-Time Model Checking
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Some Recent Results in Metric Temporal Logic
FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
LTL with the freeze quantifier and register automata
ACM Transactions on Computational Logic (TOCL)
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Weak Alternating Timed Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Model checking memoryful linear-time logics over one-counter automata
Theoretical Computer Science
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
The ω-regular post embedding problem
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Model checking freeze LTL over one-counter automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
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
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the expressiveness of MTL with past operators
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Controller synthesis for MTL specifications
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
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
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
A Translation of the Existential Model Checking Problem from MITL to HLTL
Fundamenta Informaticae
| Hi-index | 0.00 |
Metric Temporal Logic (MTL) is a real-time extension of Linear Temporal Logic that was proposed fifteen years ago and has since been extensively studied. Since the early 1990s, it has been widely believed that some very small fragments of MTL are undecidable (i.e., have undecidable satisfiability and model-checking problems). We recently showed that, on the contrary, some substantial and important fragments of MTL are decidable [19,20]. However, until now the question of the decidability of full MTL over infinite timed words remained open. In this paper, we settle the question negatively. The proof of undecidability relies on a surprisingly strong connection between MTL and a particular class of faulty Turing machines, namely ‘insertion channel machines with emptiness-testing'.