Clôtures transitives de semi-commutations et model-checking régulier.
Gérard CécéPierre-Cyrille HéamYann MainierPublished in: Tech. Sci. Informatiques (2008)
Keyphrases
- model checking
- temporal logic
- formal verification
- model checker
- symbolic model checking
- finite state
- automated verification
- partial order reduction
- formal specification
- finite state machines
- reachability analysis
- timed automata
- temporal properties
- verification method
- pspace complete
- formal methods
- epistemic logic
- transition systems
- computation tree logic
- concurrent systems
- asynchronous circuits
- process algebra
- planning domains
- bounded model checking
- knowledge base
- alternating time temporal logic
- state space