{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:21:04Z","timestamp":1725484864134},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540436317"},{"type":"electronic","value":"9783540478133"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-47813-2_5","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T22:35:31Z","timestamp":1180564531000},"page":"65-78","source":"Crossref","is-referenced-by-count":1,"title":["An Abstract Schema for Equivalence-Checking Games"],"prefix":"10.1007","author":[{"given":"Li","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,10]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01211314","volume":"5","author":"R. Cleaveland","year":"1993","unstructured":"R. Cleaveland and M. C. B. Hennessy. Testing equivalence as a bisimulation equivalence. Formal Aspects of Computing, 5:1\u201320, 1993.","journal-title":"Formal Aspects of Computing"},{"key":"5_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1007\/3-540-61474-5_87","volume-title":"Computer Aided Verification (CAV\u2019 96)","author":"R. Cleaveland","year":"1996","unstructured":"R. Cleaveland and S. Sims. The NCSU concurrency workbench. In R. Alurand T. A. Henzinger, editors, Computer Aided Verification (CAV\u2019 96), volume 1102 of Lecture Notes in Computer Science, pages 394\u2013397, New Brunswick, New Jersey, July 1996. Springer-Verlag."},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0167-6423(90)90071-K","volume":"13","author":"J.-C. Fernandez","year":"1989","unstructured":"J.-C. Fernandez. An implementation of an efficient algorithm for bisimulation equivalence. Sicence of Computer Programming, 13:219\u2013236, 1989\/90.","journal-title":"Sicence of Computer Programming"},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/2455.2460","volume":"32","author":"M. C. B. Hennessy","year":"1985","unstructured":"M. C. B. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1):137\u2013161, January 1985.","journal-title":"Journal of the ACM"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"P. C. Kanellakis and S. A. Smolka. CCS expressions, finite state processes, and three problems of equivalence. In Proceedings of the 2nd ACM Symposium on the Principles of Distributed Computing, Montreal, Canada, August 1983.","DOI":"10.1145\/800221.806724"},{"issue":"5","key":"5_CR6","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/BF01407903","volume":"16","author":"M. Main","year":"1987","unstructured":"M. Main. Trace, failure and testing equivalences for communication, concurrency, and time. International Journal of Parallel Programming, 16(5):383\u2013400, 1987.","journal-title":"International Journal of Parallel Programming"},{"key":"5_CR7","unstructured":"R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989."},{"issue":"6","key":"5_CR8","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal of Computing, 16(6):973\u2013989, December 1987.","journal-title":"SIAM Journal of Computing"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(87)90012-0","volume":"49","author":"C. Stirling","year":"1987","unstructured":"C. Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49:311\u2013347, 1987.","journal-title":"Theoretical Computer Science"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"C. Stirling. Games and modal \u03bc-calculus. In Proceedings of the Third International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61042-1_51"},{"key":"5_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/3-540-45319-9_33","volume-title":"Simulation revisited","author":"L. Tan","year":"2001","unstructured":"L. Tan and R. Cleaveland. Simulation revisited. In The 7-th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of Lecture Notes in Computer Science, pages 480\u2013495. Springer-Verlag, 2001."}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47813-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T20:04:17Z","timestamp":1550347457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47813-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540436317","9783540478133"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-47813-2_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}