par Kremer, Steve 
;Raskin, Jean-François
Référence Lecture notes in computer science, 2154, page (551-565)
Publication Publié, 2001
;Raskin, Jean-François Référence Lecture notes in computer science, 2154, page (551-565)
Publication Publié, 2001
Article révisé par les pairs
| Résumé : | In this paper, we report on a recent work for the verification of non-repudiation protocols. We propose a verification method based on the idea that non-repudiation protocols are best modeled as games. To formalize this idea, we use alternating transition systems, a game based model, to model protocols and alternating temporal logic, a game based logic, to express requirements that the protocols must ensure. This method is automated by using the model-checker Mocha, a model-checker that supports the alternating transition systems and the alternating temporal logic. Several optimistic protocols are analyzed using Mocha. |
