Paper: Real-time logics: complexity and expressiveness (at LICS 1990)

Authors: Rajeev Alur Thomas A. Henzinger

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

BibTeX

  @InProceedings{AlurHenzinger-Realtimelogicscompl,
    author = 	 {Rajeev Alur and Thomas A. Henzinger},
    title = 	 {Real-time logics: complexity and expressiveness},
    booktitle =  {Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science (LICS 1990)},
    year =	 {1990},
    month =	 {June}, 
    pages =      {390--401},
    location =   {Philadelphia, PA, USA}, 
    publisher =	 {IEEE Computer Society Press}
  }