{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T21:09:04Z","timestamp":1672520944457},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1998,9]]},"DOI":"10.1007\/bf02684333","type":"journal-article","created":{"date-parts":[[2007,8,8]],"date-time":"2007-08-08T04:39:49Z","timestamp":1186547989000},"page":"217-228","source":"Crossref","is-referenced-by-count":4,"title":["A self-stabilizing algorithm for strong fairness"],"prefix":"10.1007","volume":"60","author":[{"given":"M. H.","family":"Karaata","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Chaudhuri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02684333_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1007\/BF01872848","volume":"2","author":"K. R. Apt","year":"1988","unstructured":"Apt, K. R., Francez, N., Katz, S.: Appraising fairness in languages for distributed programming. Distr. Computing2, 226\u2013241 (1988).","journal-title":"Distr. Computing"},{"key":"BF02684333_CR2","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0950-5849(95)91493-J","volume":"37","author":"P. Chaudhuri","year":"1995","unstructured":"Chaudhuri, P.: An algorithm for distributed mutual exclusion. Inf. Software Technol.37, 375\u2013381 (1995).","journal-title":"Inf. Software Technol."},{"key":"BF02684333_CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0020-0190(91)90111-T","volume":"39","author":"F. P. Chen","year":"1991","unstructured":"Chen, F. P., Yu, N. S., Huang, S. T.: A self-stabilizing algorithm for constructing spanning trees. Inf. Proc. Lett.39, 147\u2013151 (1991).","journal-title":"Inf. Proc. Lett."},{"key":"BF02684333_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0020-0190(94)90103-1","volume":"49","author":"Z. Collin","year":"1994","unstructured":"Collin, Z., Dolev, S.: Self-stabilizing depth-first search. Inf. Proc. Lett.49, 297\u2013301 (1994).","journal-title":"Inf. Proc. Lett."},{"key":"BF02684333_CR5","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/361179.361202","volume":"17","author":"E. W. Dijkstra","year":"1974","unstructured":"Dijkstra, E. W.: Self-stabilizing systems in spite of distributed control. Comm. ACM17, 643\u2013644 (1974).","journal-title":"Comm. ACM"},{"key":"BF02684333_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-4886-6","volume-title":"Fairness","author":"N. Francez","year":"1986","unstructured":"Francez, N.: Fairness. New York: Springer 1986."},{"key":"BF02684333_CR7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BF02278857","volume":"7","author":"S. T. Huang","year":"1993","unstructured":"Huang, S. T., Chen, N. S.: Self-stabilizing depth-first token circulation on networks. Distr. Comput.7, 61\u201366 (1993).","journal-title":"Distr. Comput."},{"key":"BF02684333_CR8","unstructured":"Karaata, M. H., Chaudhuri, P.: A distributed algorithm for implementing strong fairness. Kuwait University Internal Report 1997."},{"key":"BF02684333_CR9","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/5383.5385","volume":"33","author":"L. Lamport","year":"1986","unstructured":"Lamport, L.: The mutual exclusion problem: part ii\u2014statement and solutions. J. ACM33, 327\u2013348 (1986).","journal-title":"J. ACM"},{"key":"BF02684333_CR10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/214438.214445","volume":"3","author":"M. Maekawa","year":"1985","unstructured":"Maekawa, M.: A \u221aN algorithm for mutual exclusion in decentralized systems. ACM Trans. Comput. Syst.3, 145\u2013159 (1985).","journal-title":"ACM Trans. Comput. Syst."},{"key":"BF02684333_CR11","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/358527.358537","volume":"24","author":"G. Ricart","year":"1981","unstructured":"Ricart, G., Agrawala A. K.: An optimal algorithm for mutual exclusion in computer networks. Comm. ACM24, 9\u201317 (1981).","journal-title":"Comm. ACM"},{"key":"BF02684333_CR12","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1145\/151254.151256","volume":"25","author":"M. Schneider","year":"1993","unstructured":"Schneider, M.: Self-stabilization. ACM Comput. Surv.25, 45\u201367 (1993).","journal-title":"ACM Comput. Surv."},{"key":"BF02684333_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(83)90127-5","volume":"242","author":"H. Wedde","year":"1983","unstructured":"Wedde, H.: An iterative and starvation-free solution for a general class of distributed control problems based on interaction primitives. Theor. Comput. Sci.242, 1\u201320 (1983).","journal-title":"Theor. Comput. Sci."},{"key":"BF02684333_CR14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0020-0190(81)90023-5","volume":"12","author":"J. Winkowski","year":"1981","unstructured":"Winkowski, J.: Protocols of accessing overlapping sets of resources. Inf. Proc. Lett.12, 239\u2013243 (1981).","journal-title":"Inf. Proc. Lett."}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684333.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02684333\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02684333","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,18]],"date-time":"2019-05-18T22:22:37Z","timestamp":1558218157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02684333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["BF02684333"],"URL":"https:\/\/doi.org\/10.1007\/bf02684333","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}