We summarize and reorganize some of the last decade's research on real-time extensions of temporal logic. Our main focus is on tableau constructions for model checking linear temporal formulas with timing constraints. In particular, we find that a great deal of real-time verification can be performed in polynomial space, but also that considerable care must be exercised in order to keep the real-time verification problem in polynomial space, or even decidable.
This research was supported in part by the Office of Naval Research Young Investigator award N00014-95-1-0520, by the National Science Foundation CAREER award CCR-9501708, by the National Science Foundation grant CCR-9504469, by the Defense Advanced Research Projects Agency grant NAG2-1214, by the Army Research Office MURI grant DAAH-04-96-1-0341, and by the Semiconductor Research Corporation contract 97-DC-324.041.
439 - 454
CONCUR: Concurrency Theory
Henzinger TA. It’s about time: Real-time logics reviewed. In: Vol 1466. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 1998:439-454. doi:10.1007/BFb0055640
Henzinger, T. A. (1998). It’s about time: Real-time logics reviewed (Vol. 1466, pp. 439–454). Presented at the CONCUR: Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.1007/BFb0055640
Henzinger, Thomas A. “It’s about Time: Real-Time Logics Reviewed,” 1466:439–54. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998. https://doi.org/10.1007/BFb0055640.
T. A. Henzinger, “It’s about time: Real-time logics reviewed,” presented at the CONCUR: Concurrency Theory, 1998, vol. 1466, pp. 439–454.
Henzinger TA. 1998. It’s about time: Real-time logics reviewed. CONCUR: Concurrency Theory, LNCS, vol. 1466. 439–454.
Henzinger, Thomas A. It’s about Time: Real-Time Logics Reviewed. Vol. 1466, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 1998, pp. 439–54, doi:10.1007/BFb0055640.