Practical algorithms for MSO model-checking on tree-decomposable graphs.
Alexander LangerFelix ReidlPeter RossmanithSomnath SikdarPublished in: Comput. Sci. Rev. (2014)
Keyphrases
- model checking
- finite state
- temporal logic
- graph theory
- deterministic finite automaton
- formal verification
- reachability analysis
- model checker
- temporal properties
- pspace complete
- automated verification
- bounded model checking
- linear temporal logic
- timed automata
- symbolic model checking
- verification method
- bayesian networks
- formal methods
- np complete
- data structure