{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T03:47:32Z","timestamp":1760586452166,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665311"},{"type":"electronic","value":"9783540481690"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48169-9_17","type":"book-chapter","created":{"date-parts":[[2007,11,5]],"date-time":"2007-11-05T05:36:33Z","timestamp":1194240993000},"page":"240-255","source":"Crossref","is-referenced-by-count":2,"title":["A New Rewrite Method for Proving Convergence of Self-Stabilizing Systems"],"prefix":"10.1007","author":[{"given":"Joffroy","family":"Beauquier","sequence":"first","affiliation":[]},{"given":"B\u00e9atrice","family":"B\u00e9rard","sequence":"additional","affiliation":[]},{"given":"Laurent","family":"Fribourg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,3]]},"reference":[{"issue":"2","key":"17_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1006\/jpdc.1996.0059","volume":"34","author":"G. Antonoiu","year":"1996","unstructured":"G. Antonoiu and P.K. Srimani. \u201cA Self-Stabilizing Leader Election Algorithm for Tree Graphs\u201d, Journal of Parallel and Distributed Computing, 34:2, May 1996, pp. 227\u2013232.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"17_CR2","series-title":"Lect Notes Comput Sci","first-page":"15","volume-title":"Proc. 7th WDAG","author":"Y. Afek","year":"1990","unstructured":"Y. Afek, S. Kutten and M. Yung M.. \u201cMemory efficient self stabilizing protocols for general networks\u201d, Proc. 7th WDAG, LNCS 725, Springer-Verlag, 1990, pp. 15\u201328."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"A. Arora, M.G. Gouda and T. Herman. \u201cComposite routing protocols\u201d. Proc. 2nd IEEE Symp. on Parallel and Distributed Processing, 1990.","DOI":"10.1109\/SPDP.1990.143510"},{"key":"17_CR4","unstructured":"J. Beauquier and O. Debas. \u201cAn optimal self-stabilizing algorithm for mutual exclusion on uniform bidirectional rings\u201d. Proc. 2nd Workshop on Self-Stabilizing Systems, Las Vegas, 1995, pp. 226\u2013239."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, 1993.","DOI":"10.1007\/978-1-4613-9771-7"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/63264.63403","volume":"11","author":"J.E. Burns","year":"1989","unstructured":"J.E. Burns and J. Pachl. \u201cUniform Self-Stabilizing Rings\u201d. TOPLAS 11:2, 1989.","journal-title":"TOPLAS"},{"key":"17_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3-540-10843-2_36","volume-title":"Proc. ICALP","author":"N. Dershowitz","year":"1981","unstructured":"N. Dershowitz. \u201cTermination of Linear Rewriting Systems\u201d. Proc. ICALP, LNCS 115, Springer-Verlag, 1981, pp. 448\u2013458."},{"key":"17_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-56868-9_16","volume-title":"Proc. Rewriting Techniques and Applications","author":"N. Dershowitz","year":"1993","unstructured":"N. Dershowitz and C. Hoot. \u201cTopics in termination\u201d. Proc. Rewriting Techniques and Applications, LNCS 690, Springer-Verlag, 1993, pp. 198\u2013212."},{"key":"17_CR9","first-page":"243","volume":"B","author":"N. Dershowitz","year":"1990","unstructured":"N. Dershowitz and J.-P. Jouannaud. \u201cRewrite Systems\u201d. Handbook of Theoretical Computer Science, vol. B, Elsevier\u2013MIT Press, 1990, pp. 243\u2013320.","journal-title":"Handbook of Theoretical Computer Science"},{"issue":"11","key":"17_CR10","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E.W. Dijkstra","year":"1974","unstructured":"E.W. Dijkstra. \u201cSelf-stabilizing systems in spite of distributed control\u201d. Comm. ACM 17:11, 1974, pp. 643\u2013644.","journal-title":"Comm. ACM"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01843566","volume":"1","author":"E.W. Dijkstra","year":"1986","unstructured":"E.W. Dijkstra. \u201cA Belated Proof of Self-stabilization\u201d. Distributed Computing 1:1, 1986, pp. 5\u20136.","journal-title":"Distributed Computing"},{"key":"17_CR12","unstructured":"M. Fay. \u201cFirst-order uni.cation in an equational theory\u201d. Proc. 4th Workshop on Automated Deduction, Austin, Texas, 1979, pp. 161\u2013167."},{"issue":"4","key":"17_CR13","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1145\/155183.155228","volume":"15","author":"S. Ghosh","year":"1993","unstructured":"S. Ghosh. \u201cAn Alternative Solution to a Problem on Self-Stabilization\u201d. ACM TOPLAS 15:4, 1993, pp. 735\u2013742.","journal-title":"ACM TOPLAS"},{"key":"17_CR14","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Proc. 9th WDAG","author":"M.G. Gouda","year":"1995","unstructured":"M.G. Gouda. \u201cThe triumph and tribulation of system stabilization\u201d. Proc. 9th WDAG, LNCS 972, Springer-Verlag, 1995, pp. 1\u201318."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/32.92911","volume":"17","author":"M.G. Gouda","year":"1991","unstructured":"M.G. Gouda and T. Herman. \u201cAdaptative programming\u201d. IEEE Transactions on Software Engineering 17, 1991, pp.911\u2013921.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"17_CR16","unstructured":"T. Herman. Adaptativity through distributed convergence. Ph.D. Thesis, University of Texas at Austin. 1991."},{"key":"17_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BFb0020439","volume-title":"Proc. 8th Workshop on Distributed Algorithms","author":"J.-H. Hoepman","year":"1994","unstructured":"J.-H. Hoepman. \u201cUniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings\u201d. Proc. 8th Workshop on Distributed Algorithms, LNCS 857, Springer-Verlag. 1994, pp.265\u2013279."},{"issue":"2","key":"17_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(92)90015-N","volume":"43","author":"S.C. Hsu","year":"1992","unstructured":"S.C. Hsu and S.T. Huang. \u201cA self-stabilizing algorithm for maximal matching\u201d. Information Processing Letters 43:2, 1992, pp. 77\u201381.","journal-title":"Information Processing Letters"},{"key":"17_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"Proc. 5th Conf. on Automated Deduction","author":"J.-M. Hullot","year":"1980","unstructured":"J.-M. Hullot. \u201cCanonical Forms and Unification\u201d. Proc. 5th Conf. on Automated Deduction, LNCS, Springer-Verlag, 1980, pp. 318\u2013334."},{"issue":"1","key":"17_CR20","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/78935.78938","volume":"37","author":"J. Jaffar","year":"1990","unstructured":"J. Jaffar. \u201cMinimal and Complete Word Unification\u201d. J. ACM 37:1, 1990, pp. 47\u201385.","journal-title":"J. ACM"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02278852","volume":"7","author":"S. Katz","year":"1993","unstructured":"S. Katz and K.J. Perry. \u201cSelf-stabilizing extensions for message-passing systems\u201d. Distributed Computing 7, 1993, pp. 17\u201326.","journal-title":"Distributed Computing"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0020-0190(88)90131-7","volume":"29","author":"J.L.W. Kessels","year":"1988","unstructured":"J.L.W. Kessels. \u201cAn Exercise in proving self-stabilization with a variant function\u201d. Information and Processing Letters 29, 1988, pp. 39\u201342.","journal-title":"Information and Processing Letters"},{"key":"17_CR23","series-title":"Lect Notes Comput Sci","first-page":"424","volume-title":"Proc. CAV\u201997","author":"Y. Kesten","year":"1997","unstructured":"Y. Kesten, O. Maler, M. Marcuse, A. Pnueli and E. Shahar. \u201cSymbolic Model-Checking with Rich Assertional Languages\u201d. Proc. CAV\u201997, LNCS 1254, Springer-Verlag, 1997, pp. 424\u2013435."},{"issue":"2","key":"17_CR24","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0304-3975(93)90116-B","volume":"115","author":"I. Litovski","year":"1993","unstructured":"I. Litovski and Y. M\u00e9tivier. \u201cComputing with Graph Rewriting Systems with Priorities\u201d. Theoretical Computer Science 115:2, 1993, pp. 191\u2013224.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"17_CR25","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01294595","volume":"28","author":"I. Litovski","year":"1995","unstructured":"I. Litovski, Y. M\u00e9tivier and E. Sopena. \u201cDifferent Local Controls for Graph Relabeling Systems\u201d. Mathematical Systems Theory 28:1, 1995, pp. 41\u201365.","journal-title":"Mathematical Systems Theory"},{"issue":"1","key":"17_CR26","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1006\/inco.1995.1056","volume":"118","author":"I. Litovski","year":"1995","unstructured":"I. Litovski, Y. M\u00e9tivier and W. Zielonka. \u201cOn the Recognition of Families of Graphs with Local Computations\u201d. Information and Computation 118:1, 1995, pp. 110\u2013119.","journal-title":"Information and Computation"},{"key":"17_CR27","first-page":"147","volume":"103","author":"G.S. Makanin","year":"1977","unstructured":"G.S. Makanin. \u201cThe problem of solvability of equations in a free semigroup\u201d. Matematiceskij Sbornik 103, 1977, pp. 147\u2013236.","journal-title":"Matematiceskij Sbornik"},{"key":"17_CR28","doi-asserted-by":"crossref","unstructured":"M. Schneider. \u201cSelf-Stabilization\u201d. ACM Computing Surveys 25:1, 1993.","DOI":"10.1145\/151254.151256"},{"issue":"4","key":"17_CR29","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"J.R. Slagle. \u201cAutomated Theorem-Proving for Theories with Simplifiers, Commutativity, and Associativity.\u201d J. ACM 21:4, 1974, pp. 622\u2013642.","journal-title":"J. ACM"},{"key":"17_CR30","doi-asserted-by":"crossref","unstructured":"G. Tel. Introduction to Distributed Algorithms. Cambridge University Press, 1994.","DOI":"10.1007\/BFb0020419"},{"key":"17_CR31","doi-asserted-by":"crossref","unstructured":"O. Theel and F.C. G\u00e4rtner. \u201cAn Exercise in Proving Convergence through Transfer Functions\u201d. Proc. 4th Workshop on Self-stabilizing Systems, Austin, Texas, 1999, pp. 41\u201347.","DOI":"10.1109\/SLFSTB.1999.777485"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48169-9_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T03:00:13Z","timestamp":1737514813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48169-9_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665311","9783540481690"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/3-540-48169-9_17","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}