Approximate Model Checking of PCTL Involving Unbounded Path Properties.
Samik BasuArka P. GhoshRu HePublished in: ICFEM (2009)
Keyphrases
- model checking
- temporal properties
- temporal logic
- formal verification
- finite state
- finite state machines
- epistemic logic
- partial order reduction
- formal specification
- model checker
- symbolic model checking
- verification method
- automated verification
- pspace complete
- concurrent systems
- timed automata
- bounded model checking
- computation tree logic
- transition systems
- reachability analysis
- process algebra
- formal methods
- modal logic
- multi agent systems