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
What's decidable about hybrid automata?
Journal of Computer and System Sciences
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
Well-structured transition systems everywhere!
Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Model checking of systems with many identical timed processes
Theoretical Computer Science
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Undecidable problems in unreliable computations
Theoretical Computer Science - Latin American theoretical informatics
On the Language Inclusion Problem for Timed Automata: Closing a Decidability Gap
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Theoretical Computer Science
On the Decidability of Metric Temporal Logic
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Universality and language inclusion for open and closed timed automata
HSCC'03 Proceedings of the 6th international conference on Hybrid systems: computation and control
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
ACM Transactions on Computational Logic (TOCL)
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Event-Clock Visibly Pushdown Automata
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Sampled universality of timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Model checking probabilistic timed automata with one or two clocks
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Zone-based universality analysis for single-clock timed automata
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
Post embedding problem is not primitive recursive, with applications to channel systems
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
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
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
Decision problems for the verification of real-time software
HSCC'06 Proceedings of the 9th international conference on Hybrid Systems: computation and control
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Undecidable problems about timed automata
FORMATS'06 Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed Systems
Complexity bounds for the verification of real-time software
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
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
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Unidirectional channel systems can be tested
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
The power of priority channel systems
CONCUR'13 Proceedings of the 24th international conference on Concurrency Theory
Hi-index | 0.00 |
This paper is concerned with the language inclusion problem for timed automata: given timed automata ${\mathcal A}$ and ${\mathcal B}$, is every word accepted by ${\mathcal B}$ also accepted by ${\mathcal A}$? Alur and Dill [3] showed that the language inclusion problem is decidable if ${\mathcal A}$ has no clocks and undecidable if ${\mathcal A}$ has two clocks (with no restriction on ${\mathcal B}$). However, the status of the problem when ${\mathcal A}$ has one clock is not determined by [3]. In this paper we close this gap for timed automata over infinite words by showing that the one-clock language inclusion problem is undecidable. For timed automata over finite words, building on our earlier paper [20], we show that the one-clock language inclusion problem is decidable with non-primitive recursive complexity. This reveals a surprising divergence between the theory of timed automata over finite words and over infinite words. Finally, we show that if ε-transitions or non-singular postconditions are allowed, then the one-clock language inclusion problem is undecidable over both finite and infinite words.