Back to the future: Towards a theory of timed regular languages

R. Alur, T.A. Henzinger, in:, IEEE, 1992, pp. 177–186.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
Abstract
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
Publishing Year
Date Published
1992-01-01
Page
177 - 186
Conference
FOCS: Foundations of Computer Science
IST-REx-ID

Cite this

Alur R, Henzinger TA. Back to the future: Towards a theory of timed regular languages. In: IEEE; 1992:177-186. doi:10.1109/SFCS.1992.267774
Alur, R., & Henzinger, T. A. (1992). Back to the future: Towards a theory of timed regular languages (pp. 177–186). Presented at the FOCS: Foundations of Computer Science, IEEE. https://doi.org/10.1109/SFCS.1992.267774
Alur, Rajeev, and Thomas A Henzinger. “Back to the Future: Towards a Theory of Timed Regular Languages,” 177–86. IEEE, 1992. https://doi.org/10.1109/SFCS.1992.267774.
R. Alur and T. A. Henzinger, “Back to the future: Towards a theory of timed regular languages,” presented at the FOCS: Foundations of Computer Science, 1992, pp. 177–186.
Alur R, Henzinger TA. 1992. Back to the future: Towards a theory of timed regular languages. FOCS: Foundations of Computer Science 177–186.
Alur, Rajeev, and Thomas A. Henzinger. Back to the Future: Towards a Theory of Timed Regular Languages. IEEE, 1992, pp. 177–86, doi:10.1109/SFCS.1992.267774.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar