{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T03:13:11Z","timestamp":1762917191458,"version":"3.37.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"11-12","license":[{"start":{"date-parts":[[2009,11,1]],"date-time":"2009-11-01T00:00:00Z","timestamp":1257033600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":1461,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1016\/j.scico.2009.07.006","type":"journal-article","created":{"date-parts":[[2009,8,29]],"date-time":"2009-08-29T09:47:42Z","timestamp":1251539262000},"page":"879-899","source":"Crossref","is-referenced-by-count":17,"title":["Developing topology discovery in Event-B"],"prefix":"10.1016","volume":"74","author":[{"given":"Thai Son","family":"Hoang","sequence":"first","affiliation":[]},{"given":"Hironobu","family":"Kuruma","sequence":"additional","affiliation":[]},{"given":"David","family":"Basin","sequence":"additional","affiliation":[]},{"given":"Jean-Raymond","family":"Abrial","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"year":"1996","series-title":"The B-book: Assigning programs to meanings","author":"Abrial","key":"10.1016\/j.scico.2009.07.006_b1"},{"key":"10.1016\/j.scico.2009.07.006_b2","doi-asserted-by":"crossref","unstructured":"Jean-Raymond Abrial, Modeling in Event-B: System and Software Engineering, Cambridge University Press, 2009 (in press)","DOI":"10.1017\/CBO9781139195881"},{"key":"10.1016\/j.scico.2009.07.006_b3","first-page":"588","article-title":"An open extensible tool environment for Event-B","volume":"vol. 4260","author":"Abrial","year":"2006"},{"issue":"3","key":"10.1016\/j.scico.2009.07.006_b4","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s001650300002","article-title":"A mechanically proved and incremental development of IEEE 1394 tree identify protocol","volume":"14","author":"Abrial","year":"2003","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/j.scico.2009.07.006_b5","article-title":"Refinement, decomposition, and instantiation of discrete models: Application to Event-B","volume":"XXI","author":"Abrial","year":"2006","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"10.1016\/j.scico.2009.07.006_b6","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF01558665","article-title":"Decentralization of process nets with centralized control","volume":"3","author":"Back","year":"1989","journal-title":"Distributed Computing"},{"year":"2008","series-title":"Principles of Model Checking","author":"Baier","key":"10.1016\/j.scico.2009.07.006_b7"},{"key":"10.1016\/j.scico.2009.07.006_b8","doi-asserted-by":"crossref","unstructured":"Lichun Bao, J.J. Garcia-Luna-Aceves, Link-state routing in networks with unidirectional links, in: In Proceedings Eight International Conference on Computer Communications and Networks, pp. 358\u2013363, 1999","DOI":"10.1109\/ICCCN.1999.805543"},{"issue":"4","key":"10.1016\/j.scico.2009.07.006_b9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1145\/581771.581775","article-title":"Formal verification of standards for distance vector routing protocols","volume":"49","author":"Bhargavan","year":"2002","journal-title":"Journal of ACM"},{"key":"10.1016\/j.scico.2009.07.006_b10","unstructured":"T. Clausen, G. Hansen, L. Christensen, G. Behrmann, The Optimized Link State Routing Protocol, Evaluation through Experiments and Simulation, in: IEEE Symposium on Wireless Personal Mobile Communications, September 2001"},{"key":"10.1016\/j.scico.2009.07.006_b11","article-title":"Optimized link state routing protocol","volume":"3626","author":"Clausen","year":"2003","journal-title":"Request for Comments"},{"issue":"3","key":"10.1016\/j.scico.2009.07.006_b12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1023\/A:1008764923992","article-title":"Verification of a leader election protocol: Formal methods applied to ieee 1394","volume":"16","author":"Devillers","year":"2000","journal-title":"Formal Methods in System Design"},{"key":"10.1016\/j.scico.2009.07.006_b13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF01386390","article-title":"A note on two problems in connection with graphs","volume":"1","author":"Dijkstra","year":"1959","journal-title":"Numerische Mathematik"},{"issue":"11","key":"10.1016\/j.scico.2009.07.006_b14","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","article-title":"Self-stabilizing systems in spite of distributed control","volume":"17","author":"Dijkstra","year":"1974","journal-title":"Communications of the ACM"},{"issue":"4","key":"10.1016\/j.scico.2009.07.006_b15","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1109\/12.88464","article-title":"Stabilizing communication protocols","volume":"40","author":"Gouda","year":"1991","journal-title":"IEEE Transactions on Computers"},{"year":"2003","series-title":"The Spin Model Checker: Primer and Reference Manual","author":"Holzmann","key":"10.1016\/j.scico.2009.07.006_b16"},{"issue":"3","key":"10.1016\/j.scico.2009.07.006_b17","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1145\/177492.177726","article-title":"The temporal logic of actions","volume":"16","author":"Lamport","year":"1994","journal-title":"Transactions on Programming Languages and Systems (TOPLAS)"},{"year":"1996","series-title":"Distributed Algorithms","author":"Lynch","key":"10.1016\/j.scico.2009.07.006_b18"},{"issue":"1","key":"10.1016\/j.scico.2009.07.006_b19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(91)90041-Y","article-title":"Completing the temporal picture","volume":"83","author":"Manna","year":"1991","journal-title":"Theoretical Computer Science"},{"issue":"2\u20133","key":"10.1016\/j.scico.2009.07.006_b20","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0167-6423(00)00011-3","article-title":"Distributed directory service and message routing for mobile agents","volume":"39","author":"Moreau","year":"2001","journal-title":"Science of Computer Programming"},{"year":"1998","series-title":"OSPF: Anatomy of an Internet Routing Protocol","author":"Moy","key":"10.1016\/j.scico.2009.07.006_b21"},{"key":"10.1016\/j.scico.2009.07.006_b22","doi-asserted-by":"crossref","unstructured":"J.T. Moy, et al. OSPF Version 2, 1994","DOI":"10.17487\/rfc1583"},{"key":"10.1016\/j.scico.2009.07.006_b23","doi-asserted-by":"crossref","unstructured":"Madanlal Musuvathi, David Y.W. Park, Andy Chou, Dawson R. Engler, David L. Dill, Cmc: A pragmatic approach to model checking real code, in: OSDI \u201902: Proceedings of the 5th symposium on Operating systems design and implementation, pp. 75\u201388, New York, NY, USA, 2002. ACM","DOI":"10.1145\/1060289.1060297"},{"key":"10.1016\/j.scico.2009.07.006_b24","unstructured":"Rfc3626: Optimized link state routing protocol (OLSR), October 2003"},{"issue":"3","key":"10.1016\/j.scico.2009.07.006_b25","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1145\/129393.129394","article-title":"A stepwise refinement heuristic for protocol construction","volume":"14","author":"Udaya Shankar","year":"1992","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/j.scico.2009.07.006_b26","unstructured":"Andrew Tanenbaum, Computer Networks, Prentice Hall Professional Technical Reference, 2002"},{"year":"2001","series-title":"Introduction to Distributed Algorithms","author":"Tel","key":"10.1016\/j.scico.2009.07.006_b27"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642309001117?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642309001117?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T22:34:03Z","timestamp":1739313243000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642309001117"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":27,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["S0167642309001117"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2009.07.006","relation":{},"ISSN":["0167-6423"],"issn-type":[{"type":"print","value":"0167-6423"}],"subject":[],"published":{"date-parts":[[2009,11]]}}}