A distributed design of a network recovery algorithm. (1st January 2013)

• Record Type: Journal Article
• Authors: Kamali, Maryam; Laibinis, Linas; Petre, Luigia; Sere, Kaisa
• Is Part Of: International journal of critical computer-based systems. Volume 4:Number 1(2013)
• Page Start: 45
• Page End: 68
• Publication Date: 2013-01-01
• Subjects: wireless sensor-actor networks -- WSANs -- network recovery algorithm -- distributed design -- object-orientation -- formal method -- Event-B -- refinement -- modularisation -- Rodin-tool; Computer systems -- Periodicals; Computer architecture -- Periodicals; 004
• Languages: English
• ISSNs: 1757-8779

Abstract

The increase in design complexity emphasises the relevance of formal verification techniques for both software and hardware. Formal methods with their mathematical-based modelling can provide proofs of various properties for the designs, thus ensuring a certain degree of complexity control and enhancing the system confidence. There are numerous formal modelling and verification techniques employed in designing complex systems. Typically, they either prove or disprove the correctness of the particular specifications of a system's algorithms with respect to certain initial requirements. The Event-B formal method has been recently extended to address the gap between specification and implementation, via the so-called modularisation extension. In this paper, we present a modularisation-based derivation of a distributed design for a network recovery algorithm, based on the refinement technique of Event-B. We thus contribute to enhancing the reliability and availability of network designs.