The Complexity of Propositional Linear Temporal Logics in Simple Cases

This publication has 33 references indexed in Scilit:

• The logic of “initially” and “next”: Complete axiomatization and complexity
  Information Processing Letters, 1999
• The model checker SPIN
  IEEE Transactions on Software Engineering, 1997
• The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic
  Artificial Intelligence, 1995
• Cut-free sequent and tableau systems for propositional Diodorean modal logics
  Studia Logica, 1994
• Characterizing finite Kripke structures in propositional temporal logic
  Theoretical Computer Science, 1988
• Modalities for model checking: branching time logic strikes back
  Science of Computer Programming, 1987
• Hierarchical verification of asynchronous circuits using temporal logic
  Theoretical Computer Science, 1985
• The propositional dynamic logic of deterministic, well-structured programs
  Theoretical Computer Science, 1983
• Log Space Recognition and Translation of Parenthesis Languages
  Journal of the ACM, 1977
• An algebraic study of Diodorean modal systems
  The Journal of Symbolic Logic, 1965