Developing topology discovery in Event-B

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5423 LNCS, Issue , 2009, Pages 1-19

  Hoang, Thai Son ^a   Kuruma, Hironobu ^b   Basin, David ^a   Abrial, Jean Raymond ^a  

^a ETH ZURICH   (Switzerland)

^b HITACHI LTD   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL METHODS;

DEADLOCK FREEDOM; EVENT REFINEMENTS; FORMAL DEVELOPMENT; LIVENESS PROPERTIES; NETWORK TOPOLOGY; REACTIVE SYSTEM; TOPOLOGY DISCOVERY; TOPOLOGY DISCOVERY ALGORITHMS;

TOPOLOGY;

EID: 67650434109     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00255-7_1     Document Type: Conference Paper

References (16)

1. Abrial, J.-R.: Modeling in Event-B: System and Software Design. Cambridge University Press, Cambridge (to appear, 2008)
2. Abrial, J.-R., Butler, M., Hallerstede, S., Voisin, L.: An open extensible tool environment for Event-B. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 588-605. Springer, Heidelberg (2006)
3. Abrial, J.-R., Cansell, D., Méry, D.: A mechanically proved and incremental development of IEEE 1394 tree identify protocol. Formal Asp. Comput. 14(3), 215-227 (2003)
4. Abrial, J.-R., Hallerstede, S.: Refinement, decomposition, and instantiation of discrete models: Application to Event-B. Fundamenta Informaticae, XXI (2006)
5. Back, R.-J., Kurki-Suonio, R.: Decentralization of process nets with centralized control. Distributed Computing 3(2), 73-87 (1989)
6. Bhargavan, K., Obradovic, D., Gunter, C.A.: Formal verification of standards for distance vector routing protocols. J. ACM 49(4), 538-576 (2002)
7. Clausen, T., Hansen, G., Christensen, L., Behrmann, G.: The Optimized Link State Routing Protocol, Evaluation through Experiments and Simulation. In: IEEE Symposium on Wireless Personal Mobile Communications (September 2001)
8. Clausen, T., Jacquet, P., Laouiti, A., et al.: Optimized Link State Routing Protocol. Request for Comments, 3626 (2003)
9. Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik 1, 269-271 (1959)
10. Hoang, T.S., Kuruma, H., Basin, D., Abrial, J.-R.: Developing topology discovery in Event-B. Technical Report 611, ETH Zurich, 11/2008
11. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1996)
12. Moy, J.T.: OSPF: Anatomy of an Internet Routing Protocol. Addison-Wesley Professional, Reading (1998)
13. Moy, J.T., et al.: OSPF Version 2 (1994)
14. Rfc3626: Optimized link state routing protocol (OLSR) (October 2003)
15. Udaya Shankar, A., Lam, S.S.: A stepwise refinement heuristic for protocol construction. ACM Transactions on Programming Languages and Systems 14(3), 417-461 (1992)
16. Tanenbaum, A.: Computer Networks. Prentice Hall Professional Technical Reference (2002)