{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:36Z","timestamp":1725663636620},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_44","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:16:09Z","timestamp":1330236969000},"page":"440-451","source":"Crossref","is-referenced-by-count":2,"title":["Towards the formal design of self-stabilizing distributed algorithms"],"prefix":"10.1007","author":[{"given":"P. J. A.","family":"Lentfert","sequence":"first","affiliation":[]},{"given":"S. D.","family":"Swierstra","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"A. Arora and M.G. Gouda. Distributed reset (extended abstract). In Proc. of 10th Conf. on Foundations of Software Technology and Theoretical Computer Science, pages 316\u2013331. Springer-Verlag, 1990.","DOI":"10.1007\/3-540-53487-3_54"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, B. Patt-Shamir, and G. Varghese. Self-stabilization by local checking and correction. In Proc. of 32'nd IEEE Symp. on Foundations on Computer Science, October 1991.","DOI":"10.1109\/SFCS.1991.185378"},{"key":"44_CR3","unstructured":"K.M. Chandy and J. Misra. Parallel Program Design \u2014 A Foundation. Addison-Wesley Publishing Company, Inc., 1988."},{"issue":"11","key":"44_CR4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"E.W. Dijkstra. Self-stabilizing systems in spite of distributed control. Communications of the ACM, 17(11):643\u2013644, 1974.","journal-title":"Communications of the ACM"},{"key":"44_CR5","doi-asserted-by":"crossref","unstructured":"S. Katz and K.J. Perry. Self-stabilizing extensions for message-passing systems. In Proc. of the Ninth Annual ACM Symp. on Principles of Distributed Computing, pages 91\u2013101, Quebec City, August 1990.","DOI":"10.1145\/93385.93405"},{"issue":"2","key":"44_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0020-0190(79)90151-0","volume":"8","author":"H. S. M. M. Kruijer","year":"1979","unstructured":"H.S.M. Kruijer. Self-stabilization (in spite of distributed control) in tree structured systems. Information Processing Letters, 8(2):91\u201395, 1979.","journal-title":"Information Processing Letters"},{"key":"44_CR7","doi-asserted-by":"crossref","unstructured":"P.J.A. Lentfert and S.D. Swierstra. Distributed maximum maintenance on hierarchically divided graphs. Formal Aspects of Computing, 1992.","DOI":"10.1007\/BF01211315"},{"key":"44_CR8","unstructured":"P.J.A. Lentfert and S.D. Swierstra. Towards the formal design of self-stabilizing distributed algorithms. Technical Report RUU-CS-92-25, Utrecht University, July 1992."},{"key":"44_CR9","doi-asserted-by":"crossref","unstructured":"P.J.A. Lentfert, A.H. Uittenbogaard, S.D. Swierstra, and G. Tel. Distributed hierarchical routing. Technical Report RUU-CS-89-5, Utrecht University, March 1989. Also in: P.M.G. Apers et al. (Eds.). Proc. CSN89. Utrecht, November 9\u201310, 1989.","DOI":"10.1177\/026765838900500105"},{"key":"44_CR10","unstructured":"Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems, volume 1. Springer Verlag, to appear."},{"issue":"5","key":"44_CR11","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1109\/TCOM.1980.1094721","volume":"com-28","author":"J. M. McQuillan","year":"1980","unstructured":"J.M. McQuillan, I. Richer, and E.C. Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Communications, com-28(5):711\u2013719, May 1980.","journal-title":"IEEE Trans. on Communications"},{"key":"44_CR12","unstructured":"B.A. Sanders. Stepwise refinement of mixed specifications of concurrent programs. In M. Broy and C.B. Jones, editors, Proceedings IFIP Working Conf. on Programming and Methods, pages 1\u201325. Elsevier Science Publishers B.V. (North Holland), May 1990."},{"issue":"2","key":"44_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/BF01898402","volume":"3","author":"B. A. Sanders","year":"1991","unstructured":"B.A. Sanders. Eliminating the substitution axiom from UNITY logic. Formal Aspects of Computing, 3(2):189\u2013205, 1991.","journal-title":"Formal Aspects of Computing"},{"issue":"7","key":"44_CR14","first-page":"477","volume":"20","author":"W. D. Tajibnapis","year":"1977","unstructured":"W.D. Tajibnapis. A correctness proof of a topology information maintenance protocol for a distributed computer network. Computer Systems, 20(7):477\u2013485, July 1977.","journal-title":"Computer Systems"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_44.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:04:23Z","timestamp":1605629063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}