{"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":1789390069881,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540602187","type":"print"},{"value":"9783540447382","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60218-6_23","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:51:16Z","timestamp":1330278676000},"page":"313-327","source":"Crossref","is-referenced-by-count":40,"title":["Fair testing"],"prefix":"10.1007","author":[{"given":"Ed","family":"Brinksma","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arend","family":"Rensink","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Walter","family":"Vogler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"issue":"3","key":"23_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(87)90065-X","volume":"53","author":"S. Abramsky","year":"1987","unstructured":"S. Abramsky. Observation equivalence as a testing equivalence. Theoretical Comput. Sci., 53(3):225\u2013241, 1987.","journal-title":"Theoretical Comput. Sci."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"J.C.M. Baeten and W.P. Weijland. Process Algebra. Cambridge Univ. Press 1990.","DOI":"10.1017\/CBO9780511624193"},{"key":"23_CR3","unstructured":"J. A. Bergstra, J. W. Klop, and E.-R. Olderog. Failures without chaos: A new process semantics for fair abstraction. In M. Wirsing, ed., Formal Description of Programming Concepts \u2014 III, pp. 77\u2013103. IFIP, Elsevier, 1987."},{"key":"23_CR4","unstructured":"E. Brinksma. A theory for the derivation of tests. In Aggarwal and Sabnani, eds., Protocol Specification, Testing, and Verification VIII, pp. 63\u201374. Elsevier, 1988."},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"E. Brinksma. Cache consistency by design. In Vuong and Chanson [24], pp. 53\u201367.","DOI":"10.1007\/s004460050058"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","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. J. ACM, 31(3):560\u2013599, July 1984.","journal-title":"J. ACM"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"S. D. Brookes and A. W. Roscoe. An improved failures model for communicating processes. In Brookes, Roscoe and Winskel, eds., Seminar on Concurrency, vol. 197 of LNCS, pp. 281\u2013305. Springer, 1985.","DOI":"10.1007\/3-540-15670-4_14"},{"key":"23_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF00264365","volume":"24","author":"R. Nicola De","year":"1987","unstructured":"R. De Nicola. Extensional equivalences for transition systems. Acta Inf., 24:211\u2013237, 1987.","journal-title":"Acta Inf."},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. Nicola De","year":"1984","unstructured":"R. De Nicola and M. Hennessy. Testing equivalences for processes. Theoretical Comput. Sci., 34:83\u2013133, 1984.","journal-title":"Theoretical Comput. Sci."},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"R. J. van Glabbeek. The linear time \u2014 branching time spectrum II: The semantics of sequential systems with silent moves. In Best, ed., Concur '93, vol. 715 of LNCS, pp. 66\u201381. Springer, 1993. Extended abstract.","DOI":"10.1007\/3-540-57208-2_6"},{"key":"23_CR11","unstructured":"J. F. Groote. Implementation of events in LOTOS-specifications. Master's thesis, University of Twente, 1998. Technical Report, Philips CAM Centre C.F.T."},{"issue":"4","key":"23_CR12","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"M. Hennessy. Acceptance trees. J. ACM, 32(4):896\u2013928, Oct. 1985.","journal-title":"J. ACM"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0304-3975(87)90004-1","volume":"49","author":"M. Hennessy","year":"1987","unstructured":"M. Hennessy. An algebraic theory of fair asynchronous communicating processes. Theoretical Comput. Sci., 49:121\u2013143, 1987.","journal-title":"Theoretical Comput. Sci."},{"key":"23_CR14","series-title":"Foundations of Computing Series","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"M. Hennessy. Algebraic Theory of Processes. Foundations of Computing Series. MIT Press, Boston, 1988."},{"key":"23_CR15","unstructured":"R. Langerak. A testing theory for LOTOS using deadlock detection. In Brinksma, Scollo and Vissers, eds., Protocol Specification, Testing and Verification IX, pp. 87\u201398. North-Holland 1989."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"K. G. Larsen and R. Milner. Verifying a protocol using relativized bisimulation. In T. Ottman, ed., Automata, Languages and Programming, vol. 267 of LNCS, pp. 126\u2013135. Springer, 1987.","DOI":"10.1007\/3-540-18088-5_11"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"G. Leduc. Failure-based congruences, unfair divergences, and new testing theory. In Vuong and Chanson [24].","DOI":"10.1007\/978-0-387-34867-4_17"},{"key":"23_CR18","unstructured":"R. Milner. Communication and Concurrency. Prentice-Hall, 1989."},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"V. Natarajan and R. Cleaveland. Divergence and fair testing. To be published in the proceedings of ICALP '95, 1995.","DOI":"10.1007\/3-540-60084-1_112"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"D. Park. Concurrency and automata on infinite sequences. In P. Deussen, ed., Proc. 5th GI Conference, vol. 104 of LNCS, pp. 167\u2013183. Springer, 1981.","DOI":"10.1007\/BFb0017309"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0304-3975(87)90117-4","volume":"50","author":"I. Phillips","year":"1987","unstructured":"I. Phillips. Refusal testing. Theoretical Comput. Sci., 50(2):241\u2013284, 1987.","journal-title":"Theoretical Comput. Sci."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"A. Valmari. The weakest deadlock-preserving congruence, 1995. To appear in Information Processing Letters.","DOI":"10.1016\/0020-0190(94)00214-J"},{"key":"23_CR23","doi-asserted-by":"crossref","unstructured":"W. Vogler. Modular Construction and Partial Order Semantics of Petri Nets, vol. 625 of LNCS. Springer, 1992.","DOI":"10.1007\/3-540-55767-9"},{"key":"23_CR24","doi-asserted-by":"crossref","unstructured":"S. Vuong and S. Chanson, eds. Protocol Specification, Testing, and Verification, XIV, IFIP Series. Chapman & Hall, 1995.","DOI":"10.1007\/978-0-387-34867-4"}],"container-title":["Lecture Notes in Computer Science","CONCUR '95: Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60218-6_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:55:59Z","timestamp":1605646559000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60218-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602187","9783540447382"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-60218-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995]]}}}