The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments
Open Access
- 21 March 2009
- journal article
- Published by Elsevier in Electronic Notes in Theoretical Computer Science
- Vol. 231, 277-292
Abstract
No abstract availableKeywords
All Related Versions
This publication has 7 references indexed in Scilit:
- The Complexity of Problems Defined by Boolean Circuits2005
- Past is for free: on the complexity of verifying linear temporal properties with pastActa Informatica, 2004
- Optimal satisfiability for propositional calculi and constraint satisfaction problemsInformation and Computation, 2003
- The complexity of propositional linear temporal logicsJournal of the ACM, 1985
- Satisfiability problems for propositional calculiTheory of Computing Systems, 1979
- Log Space Recognition and Translation of Parenthesis LanguagesJournal of the ACM, 1977
- The temporal logic of programs1977