Article ID Journal Published Year Pages File Type
433983 Science of Computer Programming 2014 25 Pages PDF
Abstract

Wireless sensor–actor networks are a recent development of wireless networks where both ordinary sensor nodes and more sophisticated and powerful nodes, called actors, are present. In this paper we introduce several, increasingly more detailed, formal models for this type of wireless networks. These models formalise a recently introduced algorithm for recovering actor–actor coordination links via the existing sensor infrastructure. We prove via refinement that this recovery is correct and that it terminates in a finite number of steps. In addition, we propose a generalisation of our formal development strategy, which can be reused in the context of a wider class of networks. We elaborate our models within the Event-B formalism, while our proofs are carried out using the RODIN platform — an integrated development framework for Event-B.

► We formally model a distributed recovery algorithm for wireless sensor-actor networks. ► We develop our model in four increasing levels of abstraction that refine each other. ► We prove the correctness and successful termination of the algorithm, tool-assisted. ► We put forward three types of coordination links in wireless sensor-actor networks. ► We generalise our formal model to a wider class of networks, via refinement patterns.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Authors
, , , ,