{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:52:35Z","timestamp":1725663155330},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540502418"},{"type":"electronic","value":"9783540459606"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50241-6_39","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T20:18:36Z","timestamp":1330201116000},"page":"211-222","source":"Crossref","is-referenced-by-count":0,"title":["Deciding the path- and word-fair equivalence problem"],"prefix":"10.1007","author":[{"given":"Ralf","family":"Rehrmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lutz","family":"Priese","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0167-6423(83)90004-7","volume":"3","author":"K. R. Apt","year":"1983","unstructured":"K. R. Apt and E. R. Olderog. Proof rules and transformation dealing with fairness. Science of Computer programming, 3:65\u2013100, 1983.","journal-title":"Science of Computer programming"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0020-0190(84)90114-5","volume":"18","author":"E. Best","year":"1984","unstructured":"Eike Best. Fairness and conspiracies. Information Processing Letters, 18:215\u2013220, 1984.","journal-title":"Information Processing Letters"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/BF00271640","volume":"21","author":"G. Costa","year":"1984","unstructured":"Gerardo Costa and Colin Stirling. A fair calculus of communicating systems. Acta Informatica, 21:417\u2013441, 1984.","journal-title":"Acta Informatica"},{"key":"15_CR4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0304-3975(85)90095-7","volume":"37","author":"P. Darondeau","year":"1985","unstructured":"Ph. Darondeau. About fair asynchrony. Theoretical Computer Science, 37:305\u2013336, 1985.","journal-title":"Theoretical Computer Science"},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1986-9102","volume":"IX","author":"I. Dayan","year":"1986","unstructured":"Ido Dayan and David Harel. Fair termination with cruel schedulers. Fundamenta Informaticae, IX:1\u201312, 1986.","journal-title":"Fundamenta Informaticae"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"15_CR7","unstructured":"Ir\u00e8ne Guessarian and Wafaa Niar. An Automaton Characterization of Fairness in SCCS. Report, CNRS-LITP, 1987."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1145\/4904.4993","volume":"33","author":"D. Harel","year":"1986","unstructured":"David Harel. Effective transformation on infinite trees, with application to high undecidability, dominoes and fairness. Journal of the ACM, 33:224\u2013248, 1986.","journal-title":"Journal of the ACM"},{"key":"15_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"M. Hennessy","year":"1984","unstructured":"M. Hennessy and R. de Nicola. Testing equivalences for processes. Theoretical Computer Science, 34:83\u2013133, 1984.","journal-title":"Theoretical Computer Science"},{"key":"15_CR10","first-page":"264","volume":"115","author":"P. Lehmann","year":"1981","unstructured":"P. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness. In Proceedings of the 8. ICALP, LNCS 115, pages 264\u2013277, 1981.","journal-title":"Proceedings of the 8. ICALP, LNCS"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Robin Milner. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag, 1980.","DOI":"10.1007\/3-540-10235-3"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"David Park. Concurrency and automata on infinite sequences. In Proceedings of the 5th GI conference on Theoretical Computer Science, pages 167\u2013183, Springer-Verlag, 1984.","DOI":"10.1007\/BFb0017309"},{"key":"15_CR13","unstructured":"Lucia Pomello. Some Equivalence Notions for Concurrent Systems. Technical Report 103, GMD, July 1984."},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Lutz Priese, Ralf Rehrmann, and Uwe Willecke-Klemme. An introduction to the regular theory of fairness. Theoretical Computer Science, 53, 1987.","DOI":"10.1016\/0304-3975(87)90126-5"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Lutz Priese, Ralf Rehrmann, and Uwe Willecke-Klemme. Some results on fairness \u2014 the regular case. In Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science, pages 383\u2013395, EATCS, Springer-Verlag, 1987.","DOI":"10.1007\/BFb0039621"},{"key":"15_CR16","unstructured":"Lutz Priese and Uwe Willecke-Klemme. On State Equivalence Relations in Nondeterministic or Concurrent Systems. Technical Report 34, Universit\u00e4t GH Paderborn, Dezember 1986."},{"key":"15_CR17","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. Acta Informatica, 19:195\u2013220, 1983.","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","CSL '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50241-6_39.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:33:54Z","timestamp":1640918034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50241-6_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540502418","9783540459606"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-50241-6_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}