Lower Bounds on the Complexity of MSO_1 Model-Checking.
Robert GanianPetr HlinenýAlexander LangerJan ObdrzálekPeter RossmanithSomnath SikdarPublished in: STACS (2012)
Keyphrases
- model checking
- pspace complete
- finite state
- lower bound
- temporal logic
- formal verification
- reachability analysis
- temporal properties
- model checker
- formal specification
- upper bound
- worst case
- partial order reduction
- transition systems
- timed automata
- automated verification
- symbolic model checking
- finite state machines
- bounded model checking
- np complete
- process algebra
- epistemic logic
- formal methods
- verification method
- concurrent systems
- objective function
- linear temporal logic
- markov chain
- asynchronous circuits
- tree automata
- computation tree logic
- alternating time temporal logic
- computational complexity
- petri net