{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:14:46Z","timestamp":1725455686993},"publisher-location":"Berlin\/Heidelberg","reference-count":16,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540544771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023750","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:01:03Z","timestamp":1132380063000},"page":"364-372","source":"Crossref","is-referenced-by-count":13,"title":["On automatically explaining bisimulation inequivalence"],"prefix":"10.1007","author":[{"given":"Rance","family":"Cleveland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"38_CR1","doi-asserted-by":"crossref","unstructured":"Bloom, B., S. Istrail and A. Meyer. \u201cBisimulation Can't Be Traced.\u201d In Proceedings of the ACM Symposium on Principles of Programming Languages, 1988.","DOI":"10.1145\/73560.73580"},{"key":"38_CR2","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems","author":"G. Boudol","year":"1990","unstructured":"Boudol, G., V. Roy, R. de Simone and D. Vergamini, \u201cProcess Algebras and Systems of Communicating Processes.\u201d In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, Lecture Notes in Computer Science 407, 1\u201310. Springer-Verlag, Berlin, 1990."},{"issue":"3","key":"38_CR3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1145\/828.833","volume":"31","author":"S.D. Brookes","year":"1984","unstructured":"Brookes, S.D., C.A.R. Hoare and A.W. Roscoe. \u201cA Theory of Communicating Sequential Processes.\u201d Journal of the ACM, v. 31, n. 3, July 1984, pp. 560\u2013599.","journal-title":"Journal of the ACM"},{"key":"38_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/3-540-52148-8_2","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems","author":"R. Cleaveland","year":"1990","unstructured":"Cleaveland, R. and M. Hennessy. \u201cTesting Equivalence as a Bisimulation Equivalence.\u201d In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, Lecture Notes in Computer Science 407, 11\u201323. Springer-Verlag, Berlin, 1990."},{"key":"38_CR5","first-page":"287","volume-title":"Proceedings of the Ninth IFIP Symposium on Protocol Specification, Testing and Verification","author":"R. Cleaveland","year":"1990","unstructured":"Cleaveland, R., J. Parrow and B. Steffen. \u201cA Semantics-Based Tool for the Verification of Finite-State Systems.\u201d In Proceedings of the Ninth IFIP Symposium on Protocol Specification, Testing and Verification, 287\u2013302. North-Holland, Amsterdam, 1990."},{"key":"38_CR6","series-title":"Lecture Notes in Computer Science","first-page":"24","volume-title":"Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems","author":"R. Cleaveland","year":"1989","unstructured":"Cleaveland, R., J. Parrow and B. Steffen. \u201cThe Concurrency Workbench.\u201d In Proceedings of the Workshop on Automatic Verification Methods for Finite-State Systems, Lecture Notes in Computer Science 407, 24\u201337. Springer-Verlag, Berlin, 1989."},{"key":"38_CR7","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0304-3975(84)90113-0","volume":"34","author":"R. DeNicola","year":"1983","unstructured":"DeNicola, R., and Hennessy, M. \u201cTesting Equivalences for Processes.\u201d Theoretical Computer Science, v. 34, 1983, 83\u2013133.","journal-title":"Theoretical Computer Science"},{"key":"38_CR8","volume-title":"Algebraic Theory of Processes","author":"M. Hennessy","year":"1988","unstructured":"Hennessy, M. Algebraic Theory of Processes. MIT Press, Boston, 1988."},{"issue":"1","key":"38_CR9","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 Association for Computing Machinery, v. 32, n. 1, January 1985, 137\u2013161.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"38_CR10","unstructured":"Hillerstr\u00f6m, M. Verification of CCS-processes. M.Sc. Thesis, Computer Science Department, Aalborg University, 1987."},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"Kanellakis, P. and Smolka, S.A. \u201cCCS Expressions, Finite State Processes, and Three Problems of Equivalence.\u201d In Proceedings of the Second ACM Symposium on the Principles of Distributed Computing, 1983.","DOI":"10.1145\/800221.806724"},{"key":"38_CR12","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":"38_CR13","volume-title":"Proceedings of the Workshop on Specification and Verification of Concurrent Systems","author":"J. Malhotra","year":"1988","unstructured":"Malhotra, J., Smolka, S.A., Giacalone, A. and Shapiro, R. \u201cWinston: A Tool for Hierarchical Design and Simulation of Concurrent Systems.\u201d In Proceedings of the Workshop on Specification and Verification of Concurrent Systems, University of Stirling, Scotland, 1988."},{"key":"38_CR14","unstructured":"Milner, R. Communication and Concurrency. Prentice Hall, 1989."},{"issue":"6","key":"38_CR15","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige, R. and Tarjan, R.E. \u201cThree Partition Refinement Algorithms.\u201d SIAM Journal of Computing, v. 16, n. 6, December 1987, 973\u2013989.","journal-title":"SIAM Journal of Computing"},{"key":"38_CR16","series-title":"Lecture Notes in Computer Science","first-page":"14","volume-title":"Linear and Branching Structures in the Semantics and Logics of Reactive Systems.","author":"A. Pnueli","year":"1985","unstructured":"Pnueli, A. \u201cLinear and Branching Structures in the Semantics and Logics of Reactive Systems.\u201d Lecture Notes in Computer Science 194, 14\u201332. Springer-Verlag, Berlin, 1985."}],"container-title":["Lecture Notes in Computer Science","Computer-Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023750.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:25Z","timestamp":1607550625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540544771"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0023750","relation":{},"subject":[]}}