Model Checking the HAVi Leader Election Protocol
نویسنده
چکیده
The HAVi specification [9] proposes an architecture for audio/video interoperability in home networks. Part of the HAVi specification is a distributed leader election protocol. We have modelled this leader election protocol in Promela and Lotos and have checked several properties with the tools Spin and Xtl (from the Cæsar/Aldébaran
منابع مشابه
A comparison of Spin and the muCRL toolset on HAVi leader election protocol
This paper describes an attempt to compare two toolsets allowing generation of finite labeled transition systems from underlying concurrent specification languages. The comparison is done on a specification of the leader election protocol from Home Audio/Video interoperability (HAVi) architecture. Some important semantical differences of PROMELA and μCRL are identified, that lead to big differe...
متن کاملLeader Election in Anonymous Radio Networks: Model Checking Energy Consumption
Leader election has been studied intensively in recent years. In this paper, we present an analysis of a randomized leader election using probabilistic model checking with PRISM. We first investigate the quantitative properties of the original protocol such as the expected number of election rounds. Then we modify the protocol so that it consumes less energy and process with larger energy amoun...
متن کاملAn Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP
We consider distributed timed systems that implement leader election protocols which are at the heart of clock synchronization protocols. We develop abstraction techniques for parameterized model checking of such protocols under arbitrary network topologies, where nodes have independently evolving clocks. We apply our technique for model checking the root election part of the flooding time sync...
متن کاملModel Checking the Leader Election Protocol with Fujaba
We have developed a new library for Fujaba that provides explicit concepts for hierarchical graphs. These graphs come with a generic deep clone operation, a sophisticated hash function, and an isomorphism check for pairs of graphs. Given a set of rewrite operations, above graph functionalities enable us to compute reachability graphs, i.e. from an start graph we compute the set of all graphs th...
متن کاملThe Leader Election Protocol of IEEE 1394 in Maude
In this paper we consider three descriptions, at different abstract levels, of the leader election protocol from the IEEE 1394 serial multimedia bus. The descriptions are given using the language Maude based on rewriting logic. Particularly, the time aspects of the protocol are studied. The descriptions are first validated by an exhaustive exploration of all the possible behaviors and states re...
متن کامل