Boolean Abstraction for Temporal Logic Satisfiability.
Alessandro CimattiMarco RoveriViktor SchuppanStefano TonettaPublished in: CAV (2007)
Keyphrases
- temporal logic
- satisfiability problem
- bounded model checking
- model checking
- davis putnam logemann loveland
- conjunctive normal form
- automata theoretic
- modal logic
- linear temporal logic
- concurrent systems
- model checker
- decision procedures
- computation tree logic
- verification method
- formal specification language
- mazurkiewicz traces
- decision theoretic planning
- computational complexity
- boolean formula
- propositional logic
- boolean functions
- search algorithm
- reactive systems
- dynamic constraints
- transition systems
- temporal knowledge
- temporally extended goals
- temporal abstractions
- finite state