Efficient Algorithms for Time- and Cost-Bounded Probabilistic Model Checking.
Ernst Moritz HahnArnd HartmannsPublished in: CoRR (2016)
Keyphrases
- model checking
- temporal logic
- automated verification
- temporal properties
- formal specification
- symbolic model checking
- formal verification
- partial order reduction
- finite state machines
- model checker
- reachability analysis
- verification method
- computation tree logic
- formal methods
- epistemic logic
- transition systems
- bounded model checking
- bayesian networks
- timed automata
- linear temporal logic
- reactive systems
- concurrent systems
- process algebra
- asynchronous circuits
- modal logic
- probability theory
- finite state
- satisfiability problem
- deterministic finite automaton
- knowledge base