Elementary first-order model checking for sparse graphs.
Jakub GajarskýMichal PilipczukMarek SokolowskiGiannos StamoulisSzymon TorunczykPublished in: CoRR (2024)
Keyphrases
- model checking
- linear temporal logic
- temporal logic
- temporal epistemic
- formal verification
- formal specification
- finite state
- model checker
- symbolic model checking
- partial order reduction
- automated verification
- temporal properties
- finite state machines
- bounded model checking
- epistemic logic
- computation tree logic
- formal methods
- process algebra
- pspace complete
- reachability analysis
- verification method
- timed automata
- transition systems
- first order logic
- concurrent systems
- graph theory
- set theory