Hierarchies of weak automata and weak monadic formulas
Theoretical Computer Science
Journal of the ACM (JACM)
Theoretical Computer Science
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Verifying Networks of Timed Processes (Extended Abstract)
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
On the Design of Hybrid Control Systems Using Automata Models
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
ICATPN '01 Proceedings of the 22nd International Conference on Application and Theory of Petri Nets
Automata theoretic techniques for modal logics of programs: (Extended abstract)
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
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
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
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
ACM Transactions on Computational Logic (TOCL)
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
Universality Analysis for One-Clock Timed Automata
Fundamenta Informaticae - Fundamentals of Software Engineering 2007: Selected Contributions
Weak Alternating Timed Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Zone-based universality analysis for single-clock timed automata
FSEN'07 Proceedings of the 2007 international conference on Fundamentals of software engineering
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
On the expressiveness of TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures
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
Weak Alternating Timed Automata
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
| Hi-index | 0.00 |
Alternating timed automata on infinite words are considered. The main result is a characterization of acceptance conditions for which the emptiness problem for the automata is decidable. This result implies new decidability results for fragments of timed temporal logics. It is also shown that, unlike for MITL, the characterisation remains the same even if no punctual constraints are allowed.