Model-Checking for Successor-Invariant First-Order Formulas on Graph Classes of Bounded Expansion.
Jan van den HeuvelStephan KreutzerMichal PilipczukDaniel A. QuirozRoman RabinovichSebastian SiebertzPublished in: CoRR (2017)
Keyphrases
- model checking
- linear temporal logic
- temporal logic
- bounded degree
- formal verification
- automated verification
- finite state
- temporal properties
- reachability analysis
- model checker
- bounded model checking
- linear time temporal logic
- verification method
- formal specification
- symbolic model checking
- epistemic logic
- pspace complete
- process algebra
- computation tree logic
- concurrent systems
- asynchronous circuits
- timed automata
- bounded treewidth
- formal methods
- modal logic
- reactive systems
- alternating time temporal logic
- search algorithm
- graph theory
- np complete