{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:09:04Z","timestamp":1725491344106},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540751410"},{"type":"electronic","value":"9783540751427"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75142-7_28","type":"book-chapter","created":{"date-parts":[[2007,9,5]],"date-time":"2007-09-05T14:00:46Z","timestamp":1189000846000},"page":"358-372","source":"Crossref","is-referenced-by-count":2,"title":["A Distributed Maximal Scheduler for Strong Fairness"],"prefix":"10.1007","author":[{"given":"Matthew","family":"Lang","sequence":"first","affiliation":[]},{"given":"Paolo A. G.","family":"Sivilotti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/41625.41642","volume-title":"POPL 1987","author":"K.R. Apt","year":"1987","unstructured":"Apt, K.R., Francez, N., Katz, S.: Appraising fairness in distributed languages. In: POPL 1987. Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, pp. 189\u2013198. ACM Press, New York (1987)"},{"key":"28_CR2","volume-title":"Parallel Program Design: A Foundation","author":"K.M. Chandy","year":"1988","unstructured":"Chandy, K.M., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading, Massachusetts (1988)"},{"issue":"2","key":"28_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF00289519","volume":"1","author":"E.W. Dijkstra","year":"1971","unstructured":"Dijkstra, E.W.: Hierarchical ordering of sequential processes. Acta Informatica\u00a01(2), 115\u2013138 (1971)","journal-title":"Acta Informatica"},{"issue":"2","key":"28_CR4","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/s001650070031","volume":"12","author":"R. Joshi","year":"2000","unstructured":"Joshi, R., Misra, J.: Maximally concurrent programs. Formal Aspects of Computing\u00a012(2), 100\u2013119 (2000)","journal-title":"Formal Aspects of Computing"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Joshi, R., Misra, J.: Toward a theory of maximally concurrent programs. In: Proceedings of PODC 2000, pp. 319\u2013328 (2000)","DOI":"10.1145\/343477.343634"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2000.3014","volume":"166","author":"Y.-J. Joung","year":"2001","unstructured":"Joung, Y.-J.: On fairness notions in distributed systems, part I: A characterization of implementability. Information and Computation\u00a0166, 1\u201334 (2001)","journal-title":"Information and Computation"},{"issue":"4","key":"28_CR7","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(4), 337\u2013345 (2001)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"28_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/PL00008921","volume":"13","author":"L. Lamport","year":"2000","unstructured":"Lamport, L.: Fairness and hyperfairness. Distrib. Comput.\u00a013(4), 239\u2013245 (2000)","journal-title":"Distrib. Comput."},{"key":"28_CR9","unstructured":"Lang, M., Sivilotti, P.A.G.: A distributed maximal scheduler for strong fairness. Technical Report OSU-CISRC-7\/07-TR61, The Ohio State University (July 2007)"},{"key":"28_CR10","unstructured":"Lang, M., Sivilotti, P.A.G.: The maximality of unhygienic dining philosophers. Technical Report OSU-CISRC-5\/07-TR39, The Ohio State University (May 2007)"},{"key":"28_CR11","volume-title":"Communication and concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and concurrency. Prentice-Hall, Inc., Upper Saddle River, NJ, USA (1989)"},{"key":"28_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8528-6","volume-title":"A Discipline of Multiprogramming: Programming Theory for Distributed Applications","author":"J. Misra","year":"2001","unstructured":"Misra, J.: A Discipline of Multiprogramming: Programming Theory for Distributed Applications. Springer, New York (2001)"},{"key":"28_CR13","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Proceedings of the 5th GI-Conference on Theoretical Computer Science","author":"D. Park","year":"1981","unstructured":"Park, D.: Concurrency and automata on infinite sequences. In: Proceedings of the 5th GI-Conference on Theoretical Computer Science, London, UK, pp. 167\u2013183. Springer, Heidelberg (1981)"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75142-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:52:39Z","timestamp":1619520759000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75142-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540751410","9783540751427"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75142-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}