Login / Signup

The Complexity of Generalized Satisfiability for Linear Temporal Logic.

Michael BaulandThomas SchneiderHenning SchnoorIlka SchnoorHeribert Vollmer
Published in: FoSSaCS (2007)
Keyphrases
  • linear temporal logic
  • bounded model checking
  • temporal logic
  • computational complexity
  • propositional logic
  • satisfiability problem
  • model checking
  • decision problems