Where academic tradition
meets the exciting future

A Distributed Design of a Network Recovery Algorithm

Maryam Kamali, Linas Laibinis, Luigia Petre, Kaisa Sere, A Distributed Design of a Network Recovery Algorithm. International Journal of Critical Computer-Based Systems 4(1), 45–68, 2013.

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.

BibTeX entry:

@ARTICLE{jKaLaPeSe13a,
  title = {A Distributed Design of a Network Recovery Algorithm},
  author = {Kamali, Maryam and Laibinis, Linas and Petre, Luigia and Sere, Kaisa},
  journal = {International Journal of Critical Computer-Based Systems},
  volume = {4},
  number = {1},
  publisher = {Inderscience},
  pages = {45–68},
  year = {2013},
  keywords = {wireless sensor actor networks; WSANs; network recovery algorithm; distributed design; object-orientation; formal method; Event-B; refinement; modularisation; Rodin-tool.},
}

Belongs to TUCS Research Unit(s): Distributed Systems Laboratory (DS Lab)

Publication Forum rating of this publication: level 1

Edit publication