First-Order Model Checking on Nested Pushdown Trees is Complete for Doubly Exponential Alternating Time.
Alexander KartzowPublished in: FoSSaCS (2012)
Keyphrases
- model checking
- pspace complete
- temporal logic
- linear temporal logic
- temporal epistemic
- formal verification
- model checker
- temporal properties
- finite state
- symbolic model checking
- partial order reduction
- automated verification
- formal specification
- epistemic logic
- transition systems
- timed automata
- verification method
- finite state machines
- reachability analysis
- bounded model checking
- reactive systems
- tree automata
- formal methods
- satisfiability problem
- np complete
- knowledge base
- process algebra
- markov decision processes
- multi agent systems