A Note on the Complexity of Model-Checking Bounded Multi-Pushdown Systems
Kshitij BansalStéphane DemriPublished in: CoRR (2012)
Keyphrases
- model checking
- automated verification
- pspace complete
- temporal logic
- finite state machines
- formal methods
- finite state
- model checker
- asynchronous circuits
- artifact centric
- formal verification
- temporal properties
- reactive systems
- partial order reduction
- reachability analysis
- epistemic logic
- concurrent systems
- formal specification
- symbolic model checking
- process algebra
- timed automata
- verification method
- bounded model checking
- transition systems
- satisfiability problem
- distributed systems
- computation tree logic
- computational complexity