PDL with intersection and converse: satisfiability and infinite-state model checking.
Stefan GöllerMarkus LohreyCarsten LutzPublished in: J. Symb. Log. (2009)
Keyphrases
- model checking
- temporal logic
- satisfiability problem
- bounded model checking
- formal verification
- formal specification
- model checker
- finite state
- partial order reduction
- automated verification
- temporal properties
- epistemic logic
- computation tree logic
- process algebra
- pspace complete
- finite state machines
- formal methods
- reachability analysis
- verification method
- propositional logic
- dynamic logic
- timed automata
- np complete
- modal logic
- phase transition
- symbolic model checking
- transition systems
- computational complexity
- decision procedures
- propositional dynamic logic
- concurrent systems
- linear temporal logic
- inference rules