Application of Parametric Model Checking - The Root Contention Protocol

  • Authors:
  • G. Bandini;R. Spelberg;R. de Rooij;W. Toetenel

  • Affiliations:
  • -;-;-;-

  • Venue:
  • HICSS '01 Proceedings of the 34th Annual Hawaii International Conference on System Sciences ( HICSS-34)-Volume 9 - Volume 9
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents an application of formal verification, which was carried out using the new-implemented version of the LPMC model checker tool. We focus on the modeling and the automatic verification of a protocol contained in the IEEE 1394 standard, the Root Contention protocol. The Root Contention protocol involves both real-time and randomization. As it will be shown, it is an illustrative case study, which fully demonstrates the use of the new LPMC capability of handling linear constraints in order to exploit parametric real-time model checking. Various parts of IEEE 1394 have been specified and/or formally verified. Among these are the link layer core, the leader election protocol and other communication mechanisms. In this paper, we focus in the verification of the Root Contention protocol. Verification for this protocol has, as far as we know, never been automatically verified using a model checking technique.