{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:39:50Z","timestamp":1775054390196,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540521488","type":"print"},{"value":"9783540469056","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52148-8_2","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:23:02Z","timestamp":1330186982000},"page":"11-23","source":"Crossref","is-referenced-by-count":29,"title":["Testing equivalence as a bisimulation equivalence"],"prefix":"10.1007","author":[{"given":"Rance","family":"Cleaveland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Bloom, B., S. Istrail and A. Meyer. \u201cBisimulation Can't Be Traced.\u201d Proceedings of the ACM Symposium on Principles of Programming Languages, 1988.","DOI":"10.1145\/73560.73580"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Cleaveland, R., J. Parrow and B. Steffen. \u201cThe Concurrency Workbench.\u201d To appear in the Proceedings of the Workshop on the Automated Verification of Finite-State Systems, Grenoble, 1989.","DOI":"10.1007\/3-540-52148-8_3"},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"24","author":"R. DeNicola","year":"1984","unstructured":"DeNicola, R. and M. Hennessy. \u201cTesting Equivalences for Processes.\u201d Theoretical Computer Science 24, 1984, pp. 83\u2013113.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"2_CR4","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M. \u201cAcceptance Trees.\u201d Journal of the ACM, v. 32, n. 4, October 1985, pp. 896\u2013928.","journal-title":"Journal of the ACM"},{"key":"2_CR5","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M. Algebraic Theory of Processes. MIT Press, Cambridge, 1988."},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. Hennessy","year":"1985","unstructured":"Hennessy, M. and R. Milner. \u201cAlgebraic Laws for Nondeterminism and Concurrency.\u201d Journal of the ACM, v. 32, n. 1, January 1985, pp. 137\u2013161.","journal-title":"Journal of the ACM"},{"key":"2_CR7","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R. Communicating Sequential Processes. Prentice-Hall International, London, 1985."},{"key":"2_CR8","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J. Hopcroft","year":"1979","unstructured":"Hopcroft, J. and J. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading, 1979."},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Kanellakis, P.C. and S.A. Smolka. \u201cCCS Expressions, Finite State Processes, and Three Problems of Equivalence.\u201d Proceedings of the ACM Symposium on Principles of Distributed Computing, 1983, pp. 228\u2013240.","DOI":"10.1145\/800221.806724"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Larsen, K. and A. Skou. \u201cBisimulation through Probabilistic Testing.\u201d Proceedings of the ACM Symposium on Principles of Programming Languages, 1989.","DOI":"10.1145\/75277.75307"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communicating Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science 92. Springer-Verlag, Berlin, 1980."},{"issue":"3","key":"2_CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","volume":"25","author":"R. Milner","year":"1983","unstructured":"Milner, R. \u201cCalculi for Synchrony and Asynchrony.\u201d Theoretical Computer Science, v. 25, n. 3, July 1983, pp. 267\u2013310.","journal-title":"Theoretical Computer Science"},{"key":"2_CR13","unstructured":"Milner, R. Communication and Concurrency. Prentice-Hall, 1989."},{"issue":"6","key":"2_CR14","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R. and R.E. Tarjan. \u201cThree Partition Refinement Algorithms.\u201d SIAM Journal of Computing, v. 16, n. 6, December 1987, pp. 973\u2013989.","journal-title":"SIAM Journal of Computing"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/BFb0017309","volume-title":"Concurrency and Automata in Infinite Strings","author":"D. Park","year":"1981","unstructured":"Park, D. \u201cConcurrency and Automata in Infinite Strings.\u201d Lecture Notes in Computer Science 104, pp. 167\u2013183. Springer-Verlag, Berlin, 1981."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Walker, D. \u201cBisimulations and Divergence in CCS.\u201d Proceedings of the Third Annual Symposium on Logic in Computer Science, pp. 186\u2013192. Computer Society Press, 1988.","DOI":"10.1109\/LICS.1988.5117"}],"container-title":["Lecture Notes in Computer Science","Automatic Verification Methods for Finite State Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52148-8_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:23:24Z","timestamp":1605630204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52148-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540521488","9783540469056"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-52148-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1990]]}}}