{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:21Z","timestamp":1725663861524},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540527534"},{"type":"electronic","value":"9783540471370"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52753-2_50","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:42:24Z","timestamp":1330188144000},"page":"355-368","source":"Crossref","is-referenced-by-count":0,"title":["Semantic for abstract fairness using metric spaces"],"prefix":"10.1007","author":[{"given":"Lutz","family":"Priese","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Doris","family":"Nolte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0304-3975(80)90045-6","volume":"11","author":"A. Arnold","year":"1980","unstructured":"A. Arnold and M. Nivat. Metric interpretations of infinite trees and semantics of non deterministic recursive programs. In Theoretical Computer Science, 11, pages 181\u2013205, 1980.","journal-title":"Theoretical Computer Science"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(84)90114-5","volume":"18","author":"E. Best","year":"1984","unstructured":"E. Best. Fairness and conspiracies. In Information Processing Letters, 18, pages 215\u2013220, 1984.","journal-title":"Information Processing Letters"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-15198-2_15","volume":"186","author":"G. Costa","year":"1985","unstructured":"G. Costa. A metric characterization of fair computations in ccs. In Lecture Notes in Computer Science, vol 186, pages 239\u2013251, 1985.","journal-title":"Lecture Notes in Computer Science"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(85)90095-7","volume":"37","author":"P. Darondeau","year":"1985","unstructured":"P. Darondeau. About fair asynchrony. In Theoretical Computer Science, 37, pages 305\u2013336, 1985.","journal-title":"Theoretical Computer Science"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker and J.J. Meyer. Order and metric in the stream semantics of elemental concurrency. In Acta Informatica, 1987.","DOI":"10.1007\/BF00263291"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"P. Degano and U. Montanari. Liveness properties as convergence in metric spaces. In STOC, pages 31\u201338, 1984.","DOI":"10.1145\/800057.808663"},{"key":"22_CR7","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/BFb0027043","volume":"224","author":"J. Hoogeboom","year":"1986","unstructured":"J. Hoogeboom and G. Rozenberg. Infinitary languages. In Lecture Notes in Computer Science, 224, pages 266\u2013342, 1986.","journal-title":"Lecture Notes in Computer Science"},{"key":"22_CR8","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"4","author":"L. Landweber","year":"1969","unstructured":"L. Landweber. Decision problems for w-automata. In Mathematical System Theory, 4, pages 376\u2013384, 1969.","journal-title":"Mathematical System Theory"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"R. Milner. A calculus of communicating systems. In Lecture Notes in Computer Science, 92, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"22_CR10","first-page":"171","volume":"35","author":"L. Priese","year":"1988","unstructured":"L. Priese. Fairness. In EATCS \u2014 Bulletin, 35, pages 171\u2013181, 1988.","journal-title":"EATCS \u2014 Bulletin"},{"key":"22_CR11","unstructured":"R. Rehrmann. Path \u2014 and Wordfairness. PhD thesis, U-GH Paderborn, 1988."}],"container-title":["Lecture Notes in Computer Science","CSL '89"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52753-2_50.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:09:20Z","timestamp":1619557760000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52753-2_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540527534","9783540471370"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-52753-2_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}