Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic

Danièle Beauquier; Tristan Crolard; Evguenia Prokofieva

Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic

Danièle Beauquier ¹ Tristan Crolard ¹ Evguenia Prokofieva ¹

1 LACL - Laboratoire d'Algorithmique Complexité et Logique

Abstract : The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of practical interest. Advantages of this framework are twofold: on the one hand, a great expressive power which permits in particular an easy treatment of parameters, on the other hand the modeling task is simplified by an adequat choice of tools.

Type de document :

Communication dans un congrès

TACAS, 2004, France. Springer-Verlag, pp.372-387, 2004, LNCS 2988

Domaine :

Informatique [cs] / Logique en informatique [cs.LO]

Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00094616
Contributeur : Tristan Crolard <>
Soumis le : jeudi 14 septembre 2006 - 17:01:14
Dernière modification le : jeudi 11 janvier 2018 - 06:19:28

Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic

Identifiants

Collections

Citation

Exporter

Métriques

73

Contact

Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic

Identifiants

Collections

Citation

Exporter

Partager

Métriques

73

Contact