{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,14]],"date-time":"2026-09-14T12:47:45Z","timestamp":1789390065335,"version":"build-2803163510"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[1993,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper we show how the testing equivalences and preorders on transition systems may be interpreted as instances of generalized bisimulation equivalences and prebisimulation preorders. The characterization relies on defining transformations on the transition systems in such a way that the testing relations on the original systems correspond to (pre)bisimulation relations on the altered systems. On the basis of these results, it is possible to use algorithms for determining the (pre)bisimulation relations in the case of finite-state transition systems to compute the testing relations.<\/jats:p>","DOI":"10.1007\/bf01211314","type":"journal-article","created":{"date-parts":[[2005,2,25]],"date-time":"2005-02-25T13:29:29Z","timestamp":1109338169000},"page":"1-20","source":"Crossref","is-referenced-by-count":75,"title":["Testing equivalence as a bisimulation equivalence"],"prefix":"10.1145","volume":"5","author":[{"given":"Rance","family":"Cleaveland","sequence":"first","affiliation":[{"name":"Computer Science Department, North Carolina State University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[{"name":"School of Cognitive and Computing Sciences, University of Sussex, BNI 9QH, Falmer, Brighton, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"crossref","unstructured":"Bloom B. Istrail S. and Meyer A. \u201cBisimulation Can't Be Traced.\u201d Proceedings of the ACM Symposium on Principles of Programming Languages 1988.","DOI":"10.1145\/73560.73580"},{"key":"e_1_2_1_2_2_2","first-page":"24","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems","author":"Cleaveland R.","year":"1989"},{"key":"e_1_2_1_2_3_2","first-page":"287","volume-title":"Proceedings of the Ninth Annual Workshop on Protocol Specification, Testing and Verification","author":"Cleaveland R.","year":"1990"},{"key":"e_1_2_1_2_4_2","unstructured":"Cleaveland R. Parrow J. and Steffen B. \u201cThe Concurrency Workbench: A Semantics-Based Verification Tool for Finite-State Systems.\u201d To appear in ACM Transactions on Programming Languages and Systems."},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(84)90113-0"},{"issue":"1","key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/S0019-9958(81)90082-6","article-title":"A Term Model for Synchronous Processes","volume":"51","author":"Hennessy M.","year":"1981","journal-title":"Information and Control"},{"issue":"4","key":"e_1_2_1_2_7_2","doi-asserted-by":"crossref","first-page":"896","DOI":"10.1145\/4221.4249","article-title":"Acceptance Trees","volume":"32","author":"Hennessy M.","year":"1985","journal-title":"Journal of the ACM"},{"key":"e_1_2_1_2_8_2","volume-title":"Algebraic Theory of Processes","author":"Hennessy M.","year":"1988"},{"issue":"1","key":"e_1_2_1_2_9_2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/2455.2460","article-title":"Algebraic Laws for Nondeterminism and Concurrency","volume":"32","author":"Hennessy M.","year":"1985","journal-title":"Journal of the ACM"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/3921"},{"key":"e_1_2_1_2_11_2","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"Hopcroft J.","year":"1979"},{"issue":"1","key":"e_1_2_1_2_12_2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","article-title":"CCS Expressions, Finite State Processes, and Three Problems of Equivalence","volume":"86","author":"Kanellakis P.C.","year":"1990","journal-title":"Information and Computation"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"crossref","unstructured":"Larsen K. and Skou A. \u201cBisimulation through Probabilistic Testing.\u201d Proceedings of the ACM Symposium on Principles of Programming Languages 1989.","DOI":"10.1145\/75277.75307"},{"key":"e_1_2_1_2_14_2","volume-title":"Lecture Notes in Computer Science 92","author":"Milner R.","year":"1980"},{"issue":"3","key":"e_1_2_1_2_15_2","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0304-3975(83)90114-7","article-title":"Calculi for Synchrony and Asynchrony","volume":"25","author":"Milner R.","year":"1983","journal-title":"Theoretical Computer Science"},{"key":"e_1_2_1_2_16_2","unstructured":"Milner R. Communication and Concurrency . Prentice-Hall 1989."},{"issue":"6","key":"e_1_2_1_2_17_2","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","article-title":"Three Partition Refinement Algorithms","volume":"16","author":"Paige R.","year":"1987","journal-title":"SIAM Journal of Computing"},{"key":"e_1_2_1_2_18_2","first-page":"167","volume-title":"Lecture Notes in Computer Science 104","author":"Park D.","year":"1981"},{"issue":"2","key":"e_1_2_1_2_19_2","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(90)90048-M","article-title":"Bisimulations and Divergence in CCS","volume":"85","author":"Walker D.","year":"1990","journal-title":"Information and Computation"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01211314.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01211314\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/BF01211314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:22:25Z","timestamp":1641482545000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/BF01211314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,1]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,1]]}},"alternative-id":["10.1007\/BF01211314"],"URL":"https:\/\/doi.org\/10.1007\/bf01211314","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,1]]}}}