{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:01:00Z","timestamp":1725663660543},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544302"},{"type":"electronic","value":"9783540383574"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54430-5_106","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:48:23Z","timestamp":1330210103000},"page":"455-469","source":"Crossref","is-referenced-by-count":2,"title":["Fairness in models with true concurrency"],"prefix":"10.1007","author":[{"given":"Doris","family":"Nolte","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Priese","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,4]]},"reference":[{"key":"32_CR1","first-page":"1","volume":"59","author":"G. Boudol","year":"1989","unstructured":"G. Boudol and I. Castellani. Concurrency and atomicity. In Theoretical Computer Science (59), pp 1\u201360, 1989.","journal-title":"Theoretical Computer Science"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1016\/0020-0190(84)90097-8","volume":"19","author":"E. Best","year":"1984","unstructured":"E. Best. Fairness and conspiracies \u2014 erratum. In Information Processing Letters (19), p 162, 1984.","journal-title":"Information Processing Letters"},{"key":"32_CR3","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), pp 215\u2013220, 1984.","journal-title":"Information Processing Letters"},{"key":"32_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/3-540-15198-2_15","volume":"185","author":"G. Costa","year":"1985","unstructured":"G. Costa. A metric characterization of fair computations in CCS. In Lecture Notes in Computer Science (185), pp 239\u2013252, 1985.","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0890-5401(87)90013-7","volume":"73","author":"G. Costa","year":"1987","unstructured":"G. Costa and C. Stirling. Weak and strong fairness in CCS. In Information and Computation (73), pp 207\u2013244, 1987.","journal-title":"Information and Computation"},{"key":"32_CR6","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), pp 305\u2013336, 1985.","journal-title":"Theoretical Computer Science"},{"key":"32_CR7","unstructured":"J.W. de Bakker. Designing concurrency semantics. In 11th World Computer Congress, North Holland, pp 591\u2013598, 1989."},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"J.W. de Bakker and J.H.A. Warmerdam. Metric pomset semantics for a concurrent language with recursion. In Lecture Notes in Computer Science (469), 1990.","DOI":"10.1007\/3-540-53479-2_2"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"P. Degano and U. Montanari. Liveness properties as convergence in metric spaces. In STOC, pp 31\u201338, 1984.","DOI":"10.1145\/800057.808663"},{"key":"32_CR10","unstructured":"P. Darondeau, D. Nolte, L. Priese, and S. Yoccoz. Fairness, distances and degrees. In Internal Report (1199), Unite de Recherche INRIA-Rennes, to appear in Theoretical Computer Science, 1990."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"32_CR12","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/4904.4993","volume":"33","author":"D. Harel","year":"1986","unstructured":"D. Harel. Effective transformations on infinite trees, with applications to high undecidability, dominoes, and fairness. In Journal of the ACM (33), pp 224\u2013248, 1986.","journal-title":"Journal of the ACM"},{"key":"32_CR13","volume-title":"Communicating sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"C.A.R. Hoare. Communicating sequential Processes. Prentice Hall, London, 1985."},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"M.Z. Kwiatkowska. Fairness for non-interlieving Concurrency. PhD thesis, University of Leicester, 1989.","DOI":"10.1007\/BF01887206"},{"key":"32_CR15","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/3-540-10843-2_22","volume":"115","author":"D. Lehmann","year":"1981","unstructured":"D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness. In Lecture Notes in Computer Science (115), pp 264\u2013277, 1981.","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR16","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/3-540-18086-9_26","volume":"266","author":"A. Merceron","year":"1987","unstructured":"A. Merceron. Fair processes. In Lecture Notes in Computer Science (266), pp 181\u2013195, 1987.","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"R. Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science (92), 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"32_CR18","unstructured":"E.R. Olderog and K.R. Apt. Transformations realizing fairness assumptions for parallel programs. In TR 84-8, LITP, 1984."},{"key":"32_CR19","unstructured":"L. Priese and D. Nolte. Strong fairness, metric spaces and logical complexity. In Reihe Informatik (65), U-GH Paderborn, to appear in Theoretical Computer Science, 1990."},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"V. Pratt. Modeling concurrency with partial orders. In International Journal of Parallel Programming, pp 33\u201371, 1986.","DOI":"10.1007\/BF01379149"},{"key":"32_CR21","first-page":"171","volume":"35","author":"L. Priese","year":"1988","unstructured":"L. Priese. Fairness. In EATCS \u2014 Bulletin (35), pp 171\u2013181, 1988.","journal-title":"EATCS \u2014 Bulletin"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"L. Priese. Approaching computations by ultra metrics. In Report LITP 9022, Universite Paris VII, 1990.","DOI":"10.1007\/3-540-53479-2_18"},{"key":"32_CR23","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/BFb0039621","volume":"247","author":"L. Priese","year":"1987","unstructured":"L. Priese, R. Rehrmann, and U. Willeke-Klemme. Some results on fairness \u2014 the regular case. In Lecture Notes in Computer Science (247), pp 383\u2013395, 1987.","journal-title":"Lecture Notes in Computer Science"},{"key":"32_CR24","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF00265555","volume":"19","author":"J.P. Queille","year":"1983","unstructured":"J.P. Queille and J. Sifakis. Fairness and related properties in transition systems \u2014 a temporal logic to deal with fairness. In Acta Informatica (19), pp 195\u2013220, 1983.","journal-title":"Acta Informatica"},{"key":"32_CR25","unstructured":"R. Rehrmann. Path \u2014 and wordfairness. In Reihe Informatik (43), 1988."},{"key":"32_CR26","unstructured":"H. Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill Book Company, 1967."},{"key":"32_CR27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(90)90193-L","volume":"71","author":"P.S. Thiagarajan","year":"1990","unstructured":"P.S. Thiagarajan. Some behavioural aspects of net theory. In Theoretical Computer Science (71), pp 133\u2013153, 1990.","journal-title":"Theoretical Computer Science"},{"key":"32_CR28","unstructured":"U. Willeke-Klemme. Classes of Languages of Fair Finite Automata. PhD thesis, U-GH Paderborn, 1988."}],"container-title":["Lecture Notes in Computer Science","CONCUR '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54430-5_106.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:18Z","timestamp":1605646458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54430-5_106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544302","9783540383574"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3-540-54430-5_106","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}