Thumbnail
Access Restriction
Subscribed

Author Alur, Rajeev ♦ Henzinger, Thomas A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1994
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword EXPSPACE-completeness ♦ Dense time ♦ Discrete time ♦ Linear-time temporal logic ♦ Model checking ♦ Real-time requirements
Abstract We introduce a temporal logic for the specification of real-time systems. Our logic, TPTL, employs a novel quantifier construct for referencing time: the freeze quantifier binds a variable to the time of the local temporal context.TPTL is both a natural language for specification and a suitable formalism for verification. We present a tableau-based decision procedure and a model-checking algorithm for TPTL. Several generalizations of TPTL are shown to be highly undecidable.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1994-01-02
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 41
Issue Number 1
Page Count 23
Starting Page 181
Ending Page 203


Open content in new tab

   Open content in new tab
Source: ACM Digital Library