Real-time logics: Complexity and expressiveness

R. Alur, T.A. Henzinger, in:, IEEE, 1990, pp. 390–401.

Download
No fulltext has been uploaded. References only!

Conference Paper | Published
Author
Abstract
A unifying framework for the study of real-time logics is developed. In analogy to the untimed case, the underlying classical theory of timed state sequences is identified, it is shown to be nonelementarily decidable, and its complexity and expressiveness are used as a point of reference. Two orthogonal extensions of PTL (timed propositional temporal logic and metric temporal logic) that inherit its appeal are defined: they capture elementary, yet expressively complete, fragments of the theory of timed state sequences, and thus are excellent candidates for practical real-time specification languages
Publishing Year
Date Published
1990-08-06
Page
390 - 401
Conference
LICS: Logic in Computer Science
IST-REx-ID

Cite this

Alur R, Henzinger TA. Real-time logics: Complexity and expressiveness. In: IEEE; 1990:390-401. doi:10.1109/LICS.1990.113764
Alur, R., & Henzinger, T. A. (1990). Real-time logics: Complexity and expressiveness (pp. 390–401). Presented at the LICS: Logic in Computer Science, IEEE. https://doi.org/10.1109/LICS.1990.113764
Alur, Rajeev, and Thomas A Henzinger. “Real-Time Logics: Complexity and Expressiveness,” 390–401. IEEE, 1990. https://doi.org/10.1109/LICS.1990.113764.
R. Alur and T. A. Henzinger, “Real-time logics: Complexity and expressiveness,” presented at the LICS: Logic in Computer Science, 1990, pp. 390–401.
Alur R, Henzinger TA. 1990. Real-time logics: Complexity and expressiveness. LICS: Logic in Computer Science 390–401.
Alur, Rajeev, and Thomas A. Henzinger. Real-Time Logics: Complexity and Expressiveness. IEEE, 1990, pp. 390–401, doi:10.1109/LICS.1990.113764.

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