{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T16:15:58Z","timestamp":1648743358650},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2011,4]]},"abstract":" In this paper, we address the problem of k -out-of-\u2113 exclusion, a generalization of the mutual exclusion problem, in which there are \u2113 units of a shared resource, and any process can request up to k units (1 \u2264 k \u2264 \u2113). A protocol is self-stabilizing if, starting from an arbitrary configuration, be it initial state or after a corrupted state, the protocol can start behaving normally within a finite time. We propose the first deterministic self-stabilizing distributed k -out-of-\u2113 exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process. <\/jats:p>","DOI":"10.1142\/s0129054111008283","type":"journal-article","created":{"date-parts":[[2011,4,18]],"date-time":"2011-04-18T10:11:52Z","timestamp":1303121512000},"page":"657-677","source":"Crossref","is-referenced-by-count":2,"title":["SELF-STABILIZING k-out-of-\u2113 EXCLUSION IN TREE NETWORKS"],"prefix":"10.1142","volume":"22","author":[{"given":"AJOY K.","family":"DATTA","sequence":"first","affiliation":[{"name":"School of Computer Science, University of Nevada, Las Vegas, USA"}]},{"given":"ST\u00c9PHANE","family":"DEVISMES","sequence":"additional","affiliation":[{"name":"VERIMAG, Universit\u00e9 Joseph Fourier, Grenoble, France"}]},{"given":"FLORIAN","family":"HORN","sequence":"additional","affiliation":[{"name":"LIAFA, Universit\u00e9 Paris Denis Diderot, Paris, France"}]},{"given":"LAWRENCE L.","family":"LARMORE","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Nevada, Las Vegas, USA"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45032-7_9"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.781"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1145\/361179.361202"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1145\/59287.59292"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1109\/12.88464"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02278852"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00303-4"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979732760X"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054111008283","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T15:23:21Z","timestamp":1565191401000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054111008283"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2011,4]]}},"alternative-id":["10.1142\/S0129054111008283"],"URL":"https:\/\/doi.org\/10.1142\/s0129054111008283","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}