{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T12:47:49Z","timestamp":1789390069918,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540600848","type":"print"},{"value":"9783540494256","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60084-1_112","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:39:46Z","timestamp":1330277986000},"page":"648-659","source":"Crossref","is-referenced-by-count":37,"title":["Divergence and fair testing"],"prefix":"10.1007","author":[{"given":"V.","family":"Natarajan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"55_CR1","volume-title":"Applications of Process Algebra, vol. 17 of Cambridge Tracts in Theoretical Computer Science","year":"1990","unstructured":"J.C.M. Baeten, editor. Applications of Process Algebra, vol. 17 of Cambridge Tracts in Theoretical Computer Science. Cambridge Press, Cambridge, 1990."},{"key":"55_CR2","unstructured":"J.A. Bergstra, J.W. Klop, and E.-R. Olderog. Failures without chaos: A new process semantics for fair abstraction. In M. Wirsing, editor, Formal Description Techniques\u2014III, pages 77\u2013103. North-Holland, 1987."},{"key":"55_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. Inf. Proc. Letters, 18:215\u2013220, 1984.","journal-title":"Inf. Proc. Letters"},{"issue":"3","key":"55_CR4","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"S.D. Brookes, C.A.R. Hoare, and A.W. Roscoe. A theory of communicating sequential processes. Journal of the ACM, 31(3):560\u2013599, July 1984.","journal-title":"Journal of the ACM"},{"issue":"1","key":"55_CR5","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1145\/151646.151648","volume":"15","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland, J. Parrow, and B. Steifen. The Concurrency Workbench: A semantics-based tool for the verification of finite-state systems. ACM Trans. on Prog. Lang. and Sys., 15(1):36\u201372, January 1993.","journal-title":"ACM Trans. on Prog. Lang. and Sys."},{"key":"55_CR6","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0890-5401(87)90013-7","volume":"87","author":"G. Costa","year":"1987","unstructured":"G. Costa and C. Stirling. Weak and strong fairness in CCS. Inf. and Comp., 87:207\u2013244, 1987.","journal-title":"Inf. and Comp."},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"R. De Nicola. Extensional equivalences for transition systems. Acta Inf., 1987.","DOI":"10.1007\/BF00264365"},{"key":"55_CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1983","unstructured":"R. De Nicola and M.C.B. Hennessy. Testing equivalences for processes. Theoret. Comp. Sci., 34:83\u2013133, 1983.","journal-title":"Theoret. Comp. Sci."},{"key":"55_CR9","doi-asserted-by":"crossref","unstructured":"N. Francez. Fairness. Springer-Verlag, 1986.","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"55_CR10","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(87)90004-1","volume":"49","author":"M.C.B. Hennessy","year":"1987","unstructured":"M.C.B. Hennessy. An algebraic theory of fair asynchronous communicating processes. Theoret. Comp. Sci., 49:121\u2013143, 1987.","journal-title":"Theoret. Comp. Sci."},{"key":"55_CR11","volume-title":"Algebraic Theory of Processes","author":"M.C.B. Hennessy","year":"1988","unstructured":"M.C.B. Hennessy. Algebraic Theory of Processes. MIT Press, Boston, 1988."},{"key":"55_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-6423(85)90002-4","volume":"5","author":"C.J. Koomen","year":"1985","unstructured":"C.J. Koomen. Algebraic specification and verification of communications protocols. Science of Comp. Prog., 5:1\u201336, 1985.","journal-title":"Science of Comp. Prog."},{"key":"55_CR13","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, London, 1989."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60084-1_112.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:54:36Z","timestamp":1605646476000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60084-1_112"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600848","9783540494256"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-60084-1_112","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}