Industrial deployment of system engineering methods providing high dependability and productivity


Developing topology discovery in Event-B

Hoang, Thai Son and Kuruma, Hironobu and Basin, David and Abrial, Jean-Raymond (2009) Developing topology discovery in Event-B. Science of Computer Programming, 74 (11-12). pp. 879-899.

Full text not available from this repository.

Official URL:


We present a formal development in Event-B of a distributed topology discovery algorithm. Distributed topology discovery is at the core of several routing algorithms and is the problem of each node in a network discovering and maintaining information on the network topology. One of the key challenges in developing this algorithm is specifying the problem itself. We provide a specification that includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the system reaches stable states. We prove these properties by appropriately combining proofs of invariants, event refinement, event convergence, and deadlock freedom. The combination of these features is novel and should be useful for formalizing and developing other kinds of semi-reactive systems, which are systems that react to, but do not modify, their environment. Our entire development has been formalized and machine checked using the Rodin tool.

Item Type:Article
Subjects:Event-B > Event-B Examples
ID Code:203
Deposited By:Thai Son Hoang
Deposited On:05 Feb 2010 09:55
Last Modified:05 Feb 2010 09:55

Repository Staff Only: item control page

Deploy-Project - All right reserved