A Comparison of Time- and Reward-Bounded Probabilistic Model Checking Techniques.
Ernst Moritz HahnArnd HartmannsPublished in: SETTA (2016)
Keyphrases
- model checking
- temporal logic
- formal verification
- finite state
- partial order reduction
- symbolic model checking
- model checker
- computation tree logic
- formal specification
- automated verification
- temporal properties
- bounded model checking
- verification method
- finite state machines
- reachability analysis
- pspace complete
- transition systems
- epistemic logic
- formal methods
- bayesian networks
- concurrent systems
- reinforcement learning
- timed automata
- process algebra
- satisfiability problem