{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:47:33Z","timestamp":1742914053135,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319690834"},{"type":"electronic","value":"9783319690841"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-69084-1_5","type":"book-chapter","created":{"date-parts":[[2017,10,6]],"date-time":"2017-10-06T03:30:06Z","timestamp":1507260606000},"page":"62-77","source":"Crossref","is-referenced-by-count":3,"title":["Computing the Fault-Containment Time of Self-Stabilizing Algorithms Using Markov Chains and Lumping"],"prefix":"10.1007","author":[{"given":"Volker","family":"Turau","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,7]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"48:1","DOI":"10.1145\/1798596.1798601","volume":"6","author":"Y Azar","year":"2010","unstructured":"Azar, Y., Kutten, S., Patt-Shamir, B.: Distributed error confinement. ACM Trans. Algorithms 6(3), 48:1\u201348:23 (2010)","journal-title":"ACM Trans. Algorithms"},{"key":"5_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02009-4","volume-title":"Distributed Graph Coloring: Fundamentals and Recent Developments","author":"L Barenboim","year":"2013","unstructured":"Barenboim, L., Elkin, M.: Distributed Graph Coloring: Fundamentals and Recent Developments. Morgan & Claypool Publishers, San Rafael (2013)"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Beauquier, J., Delaet, S., Haddad, S.: Necessary and sufficient conditions for 1-adaptivity. In: 20th Internatioal Parallel and Distributed Processing Symposium, pp. 10\u201316 (2006)","DOI":"10.1109\/IPDPS.2006.1639331"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Crouzen, P., Hahn, E., Hermanns, H., Dhama, A., Theel, O., Wimmer, R., Braitling, B., Becker, B.: Bounded fairness for probabilistic distributed algorithms. In: 11th International Conference Application of Concurrency to System Design, pp. 89\u201397, June 2011","DOI":"10.1109\/ACSD.2011.21"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-642-05118-0_16","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"RE Lee DeVille","year":"2009","unstructured":"Lee DeVille, R.E., Mitra, S.: Stability of distributed algorithms in the face of incessant faults. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 224\u2013237. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-05118-0_16"},{"key":"5_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/cjtcs.1997.004","volume":"4","author":"S Dolev","year":"1997","unstructured":"Dolev, S., Herman, T.: Superstabilizing protocols for dynamic distributed systems. Chicago J. Theor. Comput. Sci. 4, 1\u201340 (1997)","journal-title":"Chicago J. Theor. Comput. Sci."},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1109\/TPDS.2011.158","volume":"23","author":"S Dubois","year":"2012","unstructured":"Dubois, S., Masuzawa, T., Tixeuil, S.: Bounding the impact of unbounded attacks in stabilization. IEEE Trans. Parallel Distrib. Syst. 23(3), 460\u2013466 (2012)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-45414-4_17","volume-title":"Distributed Computing","author":"M Duflot","year":"2001","unstructured":"Duflot, M., Fribourg, L., Picaronny, C.: Randomized finite-state distributed algorithms as Markov chains. In: Welch, J. (ed.) DISC 2001. LNCS, vol. 2180, pp. 240\u2013254. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45414-4_17"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s00446-005-0142-7","volume":"18","author":"L Fribourg","year":"2006","unstructured":"Fribourg, L., Messika, S., Picaronny, C.: Coupling and self-stabilization. Distrib. Comput. 18(3), 221\u2013232 (2006)","journal-title":"Distrib. Comput."},{"issue":"1","key":"5_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/311531.311532","volume":"31","author":"FC G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, F.C.: Fundamentals of fault-tolerant distributed computing in asynchronous environments. ACM Comput. Surv. 31(1), 1\u201326 (1999)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0020-0190(96)00121-4","volume":"59","author":"S Ghosh","year":"1996","unstructured":"Ghosh, S., Gupta, A.: An exercise in fault-containment: self-stabilizing leader election. Inf. Process. Lett. 59(5), 281\u2013288 (1996)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00446-007-0032-2","volume":"20","author":"S Ghosh","year":"2007","unstructured":"Ghosh, S., Gupta, A., Herman, T., Pemmaraju, S.: Fault-containing self-stabilizing distributed protocols. Distrib. Comput. 20(1), 53\u201373 (2007)","journal-title":"Distrib. Comput."},{"issue":"5","key":"5_CR14","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1006\/jpdc.2001.1824","volume":"62","author":"S Ghosh","year":"2002","unstructured":"Ghosh, S., He, X.: Scalable self-stabilization. J. Parallel Distrib. Comput. 62(5), 945\u2013960 (2002)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR15","unstructured":"Gradinariu, M., Tixeuil, S.: Self-stabilizing vertex coloring of arbitrary graphs. In: 4th International Conference on Principles of Distributed Systems, OPODIS 2000, pp. 55\u201370 (2000)"},{"issue":"5","key":"5_CR16","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0020-0190(99)00064-2","volume":"70","author":"\u00d6 Johansson","year":"1999","unstructured":"Johansson, \u00d6.: Simple distributed $$\\delta +1$$-coloring of graphs. Inf. Process. Lett. 70(5), 229\u2013232 (1999)","journal-title":"Inf. Process. Lett."},{"key":"5_CR17","volume-title":"Finite Markov Chains","author":"JG Kemeny","year":"1976","unstructured":"Kemeny, J.G., Snell, J.L.: Finite Markov Chains. Springer, Heidelberg (1976)"},{"issue":"3","key":"5_CR18","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s00446-011-0155-3","volume":"25","author":"S K\u00f6hler","year":"2012","unstructured":"K\u00f6hler, S., Turau, V.: Fault-containing self-stabilization in asynchronous systems with constant fault-gap. Distrib. Comput. 25(3), 207\u2013224 (2012)","journal-title":"Distrib. Comput."},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/978-3-540-30538-5_33","volume-title":"FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science","author":"S Kutten","year":"2004","unstructured":"Kutten, S., Patt-Shamir, B.: Adaptive stabilization of reactive protocols. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 396\u2013407. Springer, Heidelberg (2004). doi: 10.1007\/978-3-540-30538-5_33"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-05118-0_2","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Lenzen","year":"2009","unstructured":"Lenzen, C., Suomela, J., Wattenhofer, R.: Local algorithms: self-stabilization on speed. In: Guerraoui, R., Petit, F. (eds.) SSS 2009. LNCS, vol. 5873, pp. 17\u201334. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-05118-0_2"},{"issue":"4","key":"5_CR21","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. SIAM J. Comput. 15(4), 1036\u20131055 (1986)","journal-title":"SIAM J. Comput."},{"key":"5_CR22","unstructured":"Mitton, N., Fleury, E., Gu\u00e9rin-Lassous, I., S\u00e9ricola, B., Tixeuil, S.: On fast randomized colorings in sensor networks. In: Proceedings of ICPADS, pp. 31\u201338. IEEE (2006)"},{"key":"5_CR23","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Society for Industrial and Applied Mathematics, Philadelphia (2000)"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Turau, V.: Computing the fault-containment time of self-stabilizing algorithms using Markov chains. Technical report, Hamburg University of Techology (2017)","DOI":"10.3390\/a11050058"},{"issue":"33","key":"5_CR25","doi-asserted-by":"publisher","first-page":"4361","DOI":"10.1016\/j.tcs.2010.11.010","volume":"412","author":"V Turau","year":"2011","unstructured":"Turau, V., Hauck, B.: A fault-containing self-stabilizing (3\u20132\/(delta+1))-approximation algorithm for vertex cover in anonymous networks. Theoret. Comput. Sci. 412(33), 4361\u20134371 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Yamashita, M.: Probabilistic self-stabilization and random walks. In: 2013 International Conference on Computing, Networking and Communications (ICNC), pp. 1\u20137 (2011)","DOI":"10.1109\/ICNC.2011.11"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69084-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,4]],"date-time":"2022-08-04T01:27:38Z","timestamp":1659576458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69084-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319690834","9783319690841"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69084-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}