Compositional model checking with divergence preserving branching bisimilarity is lively.
Sander de PutterFrédéric LangAnton WijsPublished in: Sci. Comput. Program. (2020)
Keyphrases
- model checking
- temporal logic
- formal verification
- formal specification
- finite state
- symbolic model checking
- automated verification
- model checker
- computation tree logic
- temporal properties
- partial order reduction
- reachability analysis
- verification method
- timed automata
- finite state machines
- epistemic logic
- bounded model checking
- linear temporal logic
- pspace complete
- search tree
- process algebra
- transition systems
- deterministic finite automaton
- branch and bound
- concurrent systems
- formal methods
- ordered binary decision diagrams
- reactive systems
- software engineering
- alternating time temporal logic
- search space