Quantitative Model Checking Revisited: Neither Decidable Nor Approximable.
Sergio GiroPedro R. D'ArgenioPublished in: FORMATS (2007)
Keyphrases
- model checking
- computation tree logic
- temporal logic
- linear time temporal logic
- formal specification
- bounded model checking
- finite state
- formal verification
- temporal properties
- automated verification
- epistemic logic
- partial order reduction
- reachability analysis
- model checker
- finite state machines
- pspace complete
- symbolic model checking
- concurrent systems
- process algebra
- formal methods
- verification method
- timed automata
- asynchronous circuits
- linear temporal logic
- reactive systems
- planning domains
- modal logic
- first order logic