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

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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-00094616
Contributor : Tristan Crolard <>
Submitted on : Thursday, September 14, 2006 - 5:01:14 PM
Last modification on : Thursday, January 11, 2018 - 6:19:28 AM

Identifiers

  • HAL Id : hal-00094616, version 1

Collections

Citation

Danièle Beauquier, Tristan Crolard, Evguenia Prokofieva. Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic. TACAS, 2004, France. pp.372-387. ⟨hal-00094616⟩

Share

Metrics

Record views

74