{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:26:53Z","timestamp":1761611213985},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429357"},{"type":"electronic","value":"9783540456353"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45635-x_19","type":"book-chapter","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T01:27:34Z","timestamp":1181179654000},"page":"166-180","source":"Crossref","is-referenced-by-count":13,"title":["Local and Symbolic Bisimulation Using Tabled Constraint Logic Programming"],"prefix":"10.1007","author":[{"given":"Samik","family":"Basu","sequence":"first","affiliation":[]},{"given":"Madhavan","family":"Mukund","sequence":"additional","affiliation":[]},{"given":"C. R.","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"I. V.","family":"Ramakrishnan","sequence":"additional","affiliation":[]},{"given":"Rakesh","family":"Verma","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,11,13]]},"reference":[{"key":"19_CR1","unstructured":"CADP. Caesar\/Aldebaran Development Package c1.112, 2001. Available from http:\/\/www.inrialpes.fr\/vasy\/cadp.html ."},{"key":"19_CR2","doi-asserted-by":"crossref","unstructured":"B. Cui and D.S. Warren. A system for tabledconstraint logic programming. In Computational Logic, pages 478\u2013492, 2000.","DOI":"10.1007\/3-540-44957-4_32"},{"key":"19_CR3","unstructured":"CWB-NC. The Concurrency Workbench of New Century v1.1.1, 2001. Available from http:\/\/www.cs.sunysb.edu\/~cwb ."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0304-3975(94)00172-F","volume":"138","author":"M. Hennessy","year":"1995","unstructured":"M. Hennessy and H. Lin. Symbolic bisimulations. Theoretical Computer Science, 138:353\u2013389, 1995.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"P.C. Kanellakis","year":"1990","unstructured":"P.C. Kanellakis and S.A. Smolka. CCS expressions, finite state processes, andthree problems of equivalence. Information and Computation, 86(1):43\u201368, May 1990.","journal-title":"Information and Computation"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Z. Li and H. Chen. Computing strong\/weak bisimulation equivalences andobservation congruence for value-passing processes. In Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 300\u2013314, 1999.","DOI":"10.1007\/3-540-49059-0_21"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"H. Lin. Symbolic transition graphs with assignments. In Concurrency Theory (CONCUR), pages 50\u201365, 1996.","DOI":"10.1007\/3-540-61604-7_47"},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"S. Mukhopadhyay and A. Podelski. Constraint database models characterizing timedbisimilarity. In Practical Applications of Declarative Language, 2001.","DOI":"10.1007\/3-540-45241-9_17"},{"issue":"6","key":"19_CR9","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":"19_CR10","doi-asserted-by":"crossref","unstructured":"J. Parrow. An introduction to \u03c0-calculus. In J.A. Bergstra, A. Ponse, and S.A. Smolka, editors, Handbook of Process Algebra, chapter 8, pages 479\u2013544. North-Holland, 2001.","DOI":"10.1016\/B978-044482830-9\/50026-6"},{"key":"19_CR11","volume-title":"Proceedings of the 9th International Conference on Computer-Aided Verification (CAV\u2019 97)","author":"Y. S. Ramakrishna","year":"1997","unstructured":"Y. S. Ramakrishna, C. R. Ramakrishnan, I. V. Ramakrishnan, S. A. Smolka, T. Swift, and D. S. Warren. Efficient model checking using tabledresolution. In Proceedings of the 9th International Conference on Computer-Aided Verification (CAV\u2019 97), Haifa, Israel, July 1997. Springer-Verlag."},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"C.R. Ramakrishnan, I.V. Ramakrishnan, S.A. Smolka, Y. Dong, X. Du, A. Roychoudhury, and V.N. Venkatakrishnan. XMC: A logic-programming-based verification toolset. In Computer Aided Verification (CAV), 2000.","DOI":"10.1007\/10722167_48"},{"key":"19_CR13","unstructured":"XSB. The XSB logic programming system v2.3, 2001. Available from http:\/\/www.cs.sunysb.edu\/~sbprolog ."}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45635-X_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:41:25Z","timestamp":1556480485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45635-X_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429357","9783540456353"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-45635-x_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}