{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:12Z","timestamp":1742913732427,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642160226"},{"type":"electronic","value":"9783642160233"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16023-3_9","type":"book-chapter","created":{"date-parts":[[2010,9,19]],"date-time":"2010-09-19T20:41:49Z","timestamp":1284928909000},"page":"80-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Tranformational Approach for Designing Scheduler-Oblivious Self-stabilizing Algorithms"],"prefix":"10.1007","author":[{"given":"Abhishek","family":"Dhama","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Theel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,9,20]]},"reference":[{"key":"9_CR1","volume-title":"Interconnections: bridges, routers, switches, and internetworking protocols","author":"R. Perlman","year":"1999","unstructured":"Perlman, R.: Interconnections: bridges, routers, switches, and internetworking protocols. Addison-Wesley Longman, Amsterdam (1999)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/71.899941","volume":"12","author":"T. Tsuchiya","year":"2001","unstructured":"Tsuchiya, T., Nagano, S., Paidi, R.B., Kikuno, T.: Symbolic model checking for self-stabilizing algorithms. IEEE Trans. Parallel Distrib. Syst.\u00a012, 81\u201395 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR3","unstructured":"Burns, J.E., Gouda, M.G., Miller, R.E.: On Relaxing Interleaving Assumptions. In: Proc. MCC Workshop on Self-Stabilization. MCC Tech. Rep. STP, pp. 379\u2013389 (1989)"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00446-007-0033-1","volume":"20","author":"M.G. Gouda","year":"2007","unstructured":"Gouda, M.G., Haddix, F.F.: The alternator. Distributed Computing\u00a020, 21\u201328 (2007)","journal-title":"Distributed Computing"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/3-540-45438-1_8","volume-title":"Self-Stabilizing Systems","author":"M.G. Gouda","year":"2001","unstructured":"Gouda, M.G.: The Theory of Weak Stabilization. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol.\u00a02194, pp. 114\u2013123. Springer, Heidelberg (2001)"},{"key":"9_CR6","first-page":"681","volume-title":"ICDCS","author":"S. Devismes","year":"2008","unstructured":"Devismes, S., Tixeuil, S., Yamashita, M.: Weak vs. Self vs. Probabilistic Stabilization. In: ICDCS, pp. 681\u2013688. IEEE Computer Society, Los Alamitos (2008)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-02658-4_10","volume-title":"Computer Aided Verification","author":"A. Basu","year":"2009","unstructured":"Basu, A., Bensalem, S., Peled, D., Sifakis, J.: Priority Scheduling of Distributed Systems Based on Model Checking. In: Bouajjani, A., Maler, O. (eds.) Computer Aided Verification. LNCS, vol.\u00a05643, pp. 79\u201393. Springer, Heidelberg (2009)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1142\/S0129054107004553","volume":"18","author":"I. Balaban","year":"2007","unstructured":"Balaban, I., Pnueli, A., Zuck, L.D.: Modular Ranking Abstraction. Int. J. Found. Comput. Sci.\u00a018, 5\u201344 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/11539452_35","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"H. V\u00f6lzer","year":"2005","unstructured":"V\u00f6lzer, H., Varacca, D., Kindler, E.: Defining Fairness. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 458\u2013472. Springer, Heidelberg (2005)"},{"key":"9_CR10","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S. Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. The MIT Press, Cambridge (2000)"},{"key":"9_CR11","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":"Kessels, J.L.W.: An Exercise in Proving Self-Stabilization with a Variant Function. Inf. Process. Lett.\u00a029, 39\u201342 (1988)","journal-title":"Inf. Process. Lett."},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-40026-5_14","volume-title":"Distributed Computing","author":"O. Theel","year":"2000","unstructured":"Theel, O.: Exploitation of Ljapunov Theory for Verifying Self-Stabilizing Algorithms. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 209\u2013222. Springer, Heidelberg (2000)"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0304-3975(96)00286-1","volume":"186","author":"Y. Afek","year":"1997","unstructured":"Afek, Y., Kutten, S., Yung, M.: The Local Detection Paradigm and Its Application to Self-Stabilization. Theor. Comput. Sci.\u00a0186, 199\u2013229 (1997)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S. Dolev","year":"1993","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-Stabilization of Dynamic Systems Assuming Only Read\/Write Atomicity. Distributed Computing\u00a07, 3\u201316 (1993)","journal-title":"Distributed Computing"},{"key":"9_CR15","first-page":"1","volume-title":"Intl. Sym. Parallel and Distributed Processing","author":"C. Boulinier","year":"2008","unstructured":"Boulinier, C., Petit, F.: Self-stabilizing wavelets and rho-hops coordination. In: Intl. Sym. Parallel and Distributed Processing, pp. 1\u20138. IEEE, Los Alamitos (2008)"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Danturi, P., Nesterenko, M., Tixeuil, S.: Self-Stabilizing Philosophers with Generic Conflicts. ACM Trans. Autonomous and Adaptive Systems\u00a04 (2009)","DOI":"10.1145\/1462187.1462194"},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02278852","volume":"7","author":"S. Katz","year":"1993","unstructured":"Katz, S., Perry, K.J.: Self-Stabilizing Extensions for Message-Passing Systems. Distributed Computing\u00a07, 17\u201326 (1993)","journal-title":"Distributed Computing"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Varghese, G.: Distributed Program Checking: a Paradigm for Building Self-stabilizing Distributed Protocols. In: FOCS, pp. 258\u2013267 (1991)","DOI":"10.1109\/SFCS.1991.185377"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Patt-Shamir, B., Varghese, G.: Self-Stabilization By Local Checking and Correction. In: FOCS, pp. 268\u2013277 (1991)","DOI":"10.1109\/SFCS.1991.185378"},{"key":"9_CR20","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1006\/jpdc.2001.1823","volume":"62","author":"Y. Afek","year":"2002","unstructured":"Afek, Y., Dolev, S.: Local Stabilizer. J. Parallel Distrib. Comput.\u00a062, 745\u2013765 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/BFb0056474","volume-title":"Distributed Computing","author":"J. Beauquier","year":"1998","unstructured":"Beauquier, J., Dela\u00ebt, S., Dolev, S., Tixeuil, S.: Transient Fault Detectors. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 62\u201374. Springer, Heidelberg (1998)"},{"key":"9_CR22","first-page":"1026","volume":"43","author":"A. Arora","year":"1994","unstructured":"Arora, A., Gouda, M.G.: Distributed Reset. IEEE ToC\u00a043, 1026\u20131038 (1994)","journal-title":"IEEE ToC"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1007\/3-540-61769-8_20","volume-title":"Distributed Algorithms","author":"M. Mizuno","year":"1996","unstructured":"Mizuno, M., Kakugawa, H.: A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments. In: Babao\u011flu, \u00d6., Marzullo, K. (eds.) WDAG 1996. LNCS, vol.\u00a01151, pp. 304\u2013321. Springer, Heidelberg (1996)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Kakugawa, H., Mizuno, M., Nesterenko, M.: Development of Self-Stabilizing Distributed Algorithms using Transformation: Case Studies. In: WSS, pp. 16\u201330. Carleton University Press (1997)","DOI":"10.1515\/9780773591141-003"},{"key":"9_CR25","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1145\/1780.1804","volume":"6","author":"K.M. Chandy","year":"1984","unstructured":"Chandy, K.M., Misra, J.: The Drinking Philosopher\u2019s Problem. ACM ToPLaS\u00a06, 632\u2013646 (1984)","journal-title":"ACM ToPLaS"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-40026-5_15","volume-title":"Distributed Computing","author":"J. Beauquier","year":"2000","unstructured":"Beauquier, J., Datta, A.K., Gradinariu, M., Magniette, F.: Self-Stabilizing Local Mutual Exclusion and Daemon Refinement. In: Herlihy, M.P. (ed.) DISC 2000. LNCS, vol.\u00a01914, pp. 223\u2013237. Springer, Heidelberg (2000)"},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1006\/jpdc.2001.1828","volume":"62","author":"M. Nesterenko","year":"2002","unstructured":"Nesterenko, M., Arora, A.: Stabilization-Preserving Atomicity Refinement. J. Parallel Distrib. Comput.\u00a062, 766\u2013791 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Boulinier, C., Petit, F., Villain, V.: When Graph Theory helps Self-Stabilization. In: Proc. 23rd Annual ACM Symposium on Principles of Distributed Computing, pp. 150\u2013159 (2004)","DOI":"10.1145\/1011767.1011790"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45438-1_2","volume-title":"Self-Stabilizing Systems","author":"J. Beauquier","year":"2001","unstructured":"Beauquier, J., Gradinariu, M., Johnen, C.: Cross-Over Composition - Enforcement of Fairness under Unfair Adversary. In: Datta, A.K., Herman, T. (eds.) WSS 2001. LNCS, vol.\u00a02194, pp. 19\u201334. Springer, Heidelberg (2001)"},{"key":"9_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-49823-0_6","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"J. Beauquier","year":"2006","unstructured":"Beauquier, J., Johnen, C., Messika, S.: All k -Bounded Policies Are Equivalent for Self-stabilization. In: Datta, A.K., Gradinariu, M. (eds.) SSS 2006. LNCS, vol.\u00a04280, pp. 82\u201394. Springer, Heidelberg (2006)"},{"key":"9_CR31","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/71.920585","volume":"12","author":"M.H. Karaata","year":"2001","unstructured":"Karaata, M.H.: Self-Stabilizing Strong Fairness under Weak Fairness. IEEE Trans. Parallel Distrib. Syst.\u00a012, 337\u2013345 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-75142-7_28","volume-title":"Distributed Computing","author":"M. Lang","year":"2007","unstructured":"Lang, M., Sivilotti, P.A.G.: A Distributed Maximal Scheduler for Strong Fairness. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 358\u2013372. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16023-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T22:45:51Z","timestamp":1740523551000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-16023-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160226","9783642160233"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16023-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"20 September 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}