Temporal logic can be more expressive
- 1 October 1981
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 68 (02725428), 340-348
- https://doi.org/10.1109/sfcs.1981.44
Abstract
We start by proving that some properties of sequences are not expressible in Temporal Logic though they are expressible using for instance regular expressions. Then, we show how Temporal Logic can be extended to express any such property definable by a right-linear grammar and hence a regular expression, Finally, we give a decision procedure and complete axiomatization for the extended Temporal Logic.Keywords
This publication has 7 references indexed in Scilit:
- Using graphs to understand PDLPublished by Springer Nature ,2005
- The temporal logic of branching timePublished by Association for Computing Machinery (ACM) ,1981
- On the temporal analysis of fairnessPublished by Association for Computing Machinery (ACM) ,1980
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979
- First-Order Dynamic LogicLecture Notes in Computer Science, 1979
- The temporal logic of programsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1977
- Path ExpressionsPublished by Defense Technical Information Center (DTIC) ,1975