Decomposition and Composition of Timed Automata
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
A temporal logic-based planning and execution monitoring framework for unmanned aircraft systems
Autonomous Agents and Multi-Agent Systems
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Timer formulas and decidable metric temporal logic
Information and Computation
On the expressiveness of MTL variants over dense time
FORMATS'07 Proceedings of the 5th international conference on Formal modeling and analysis of timed systems
Unambiguity in timed regular languages: automata and logics
FORMATS'10 Proceedings of the 8th international conference on Formal modeling and analysis of timed systems
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
Real time temporal logic: past, present, future
FORMATS'05 Proceedings of the Third 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 TPTL and MTL
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Real-Counter automata and their decision problems
FSTTCS'04 Proceedings of the 24th international conference on Foundations of Software Technology and Theoretical Computer Science
Logics for Real Time: Decidability and Complexity
Fundamenta Informaticae - Continuous Time Paradigms in Logic and Automata
Timed Automata with non-Instantaneous Actions
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2000)
Characterization of the Expressive Power of Silent Transitions in Timed Automata
Fundamenta Informaticae
The unary fragments of metric interval temporal logic: bounded versus lower bound constraints
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |
The authors introduce two-way timed automata-timed automata that can move back and forth while reading a timed word. Two-wayness in its unrestricted form leads, like nondeterminism, to the undecidability of language inclusion. However, if they restrict the number of times an input symbol may be revisited, then two-wayness is both harmless and desirable. The authors show that the resulting class of bounded two-way deterministic timed automata is closed under all boolean operations, has decidable (PSPACE-complete) emptiness and inclusion problems, and subsumes all decidable real-time logics we know. They obtain a strict hierarchy of real-time properties: deterministic timed automata can accept more languages as the bound on the number of times an input symbol may be revisited is increased. This hierarchy is also enforced by the number of alternations between past and future operators in temporal logic. The combination of the results leads to a decision procedure for a real-time logic with past operators.