Lower Bounds on the Complexity of MSO1 Model-Checking
Robert GanianPetr HlinenýAlexander LangerJan ObdrzálekPeter RossmanithSomnath SikdarPublished in: CoRR (2011)
Keyphrases
- model checking
- finite state
- pspace complete
- lower bound
- temporal logic
- formal verification
- temporal properties
- automated verification
- model checker
- worst case
- partial order reduction
- bounded model checking
- formal specification
- upper bound
- computation tree logic
- symbolic model checking
- finite state machines
- reachability analysis
- verification method
- epistemic logic
- objective function
- np hard
- np complete
- timed automata
- markov chain
- linear temporal logic
- formal methods
- concurrent systems
- transition systems
- tree automata
- process algebra
- asynchronous circuits
- regular expressions
- computational complexity
- reactive systems
- decision problems
- knowledge based systems