Model Checking CSL until Formulae with Random Time Bounds.
Marta Z. KwiatkowskaGethin NormanAntónio PachecoPublished in: PAPM-PROBMIV (2002)
Keyphrases
- model checking
- temporal logic
- temporal properties
- formal specification
- partial order reduction
- automated verification
- formal verification
- model checker
- symbolic model checking
- finite state machines
- verification method
- process algebra
- transition systems
- finite state
- timed automata
- reachability analysis
- lower bound
- epistemic logic
- concurrent systems
- bounded model checking
- pspace complete
- computation tree logic
- formal methods
- asynchronous circuits
- reactive systems
- deterministic finite automaton