A hierarchy of temporal logics with past
Authors:
- F. LaroussinieFLF. Laroussinie
- Ph. SchnoebelenPSPh. Schnoebelen
- 1 September 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 148 (2) , 303-324
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Ockhamist Computational Logic: Past-Sensitive Necessitation in CTLJournal of Logic and Computation, 1993
- Symbolic model checking: 1020 States and beyondInformation and Computation, 1992
- A new algebraic semantic approach and some adequate connectives for computation with temporal logic over discrete timeJournal of Applied Non-Classical Logics, 1992
- Characterizing finite Kripke structures in propositional temporal logicTheoretical Computer Science, 1988
- Automatic verification of finite-state concurrent systems using temporal logic specificationsACM Transactions on Programming Languages and Systems, 1986
- “Sometimes” and “not never” revisitedJournal of the ACM, 1986
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Decision procedures and expressiveness in the temporal logic of branching timeJournal of Computer and System Sciences, 1985
- The temporal logic of branching timeActa Informatica, 1983