Probabilistic Model Checking of the CSMA/CD Protocol Using PRISM and APMC.
Marie DuflotLaurent FribourgThomas HéraultRichard LassaigneFrédéric MagnietteStéphane MessikaSylvain PeyronnetClaudine PicaronnyPublished in: Electron. Notes Theor. Comput. Sci. (2005)
Keyphrases
- model checking
- model checker
- temporal logic
- formal verification
- multiple access
- symbolic model checking
- temporal properties
- automated verification
- formal methods
- finite state
- partial order reduction
- verification method
- formal specification
- finite state machines
- bounded model checking
- transition systems
- computation tree logic
- timed automata
- epistemic logic
- bayesian networks
- pspace complete
- reachability analysis
- planning domains
- process algebra
- description language
- asynchronous circuits
- concurrent systems
- satisfiability problem
- modal logic
- ai planning
- communication protocol
- probabilistic reasoning
- web services
- ordered binary decision diagrams
- deterministic finite automaton
- np hard