Developing Topology Discovery in Event-B [chapter]

Thai Son Hoang, Hironobu Kuruma, David Basin, Jean-Raymond Abrial
2009 Lecture Notes in Computer Science  
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 is specifying the problem itself. Our specification includes both safety properties, formalizing invariants that should hold in all system states, and liveness properties that characterize when the
more » ... system reaches stable states. We establish these by appropriately combining proofs of invariant preservation, 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.
doi:10.1007/978-3-642-00255-7_1 fatcat:lf6v2ei2ufglvm5jzyatobzeb4