Abstract

The authors present a single exponent decision procedure for the validity of XCTL formulas, and a double exponent decision procedure for the validity of XCTL formulas over finite state programs (model checking). The expressive power of XCTL is compared with that of some other logics proposed for the expression of real time properties. It is shown that it is incomparable with the expressive power of the recently proposed logic TPTL (timed propositional temporal logic).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Keywords

Expressive powerExponentTemporal logicModel checkingPropositional calculusComputer scienceState (computer science)Theoretical computer sciencePower (physics)Artificial intelligenceDiscrete mathematicsMathematicsAlgorithmProgramming languageLinguistics

Affiliated Institutions

Related Publications

A really temporal logic

A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers ov...

1989 30th Annual Symposium on Foundations ... 162 citations

Publication Info

Year
2002
Type
article
Pages
402-413
Citations
136
Access
Closed

Social Impact

Altmetric

Social media, news, blog, policy document mentions

Citation Metrics

136
OpenAlex
8
Influential
62
CrossRef

Cite This

Eyal Harel, Orna Lichtenstein, Amir Pnueli (2002). Explicit clock temporal logic. [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science , 402-413. https://doi.org/10.1109/lics.1990.113765

Identifiers

DOI
10.1109/lics.1990.113765

Data Quality

Data completeness: 77%