{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:16:35Z","timestamp":1725495395972},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657033"},{"type":"electronic","value":"9783540490593"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49059-0_20","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T21:56:57Z","timestamp":1194991017000},"page":"285-299","source":"Crossref","is-referenced-by-count":4,"title":["On the Benefits of Using the Up-To Techniques for Bisimulation Verification"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Hirschkoff","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,3,12]]},"reference":[{"key":"20_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CAV\u201991","author":"J.-C. Fernandez","year":"1991","unstructured":"J.-C. Fernandez and L. Mounier. \u201cOn the fly\u201d verification of behavioural equivalences and preorders. In Proceedings of CAV\u201991, LNCS, 1991."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"D. Hirschkoff. Automatically Proving Up To Bisimulation. In Proceedings of MFCS\u201998 Workshop on Concurrency, volume 18 of ENTCS, 1998.","DOI":"10.1016\/S1571-0661(05)80251-8"},{"key":"20_CR3","unstructured":"B. Mammas. Une mt\u00e9thodologie de preuves orient\u00e9e contraintes et bas\u00e9e sur les syst\u00e8mes de transitions modales. Technical report, LIP6, UPMC, 1998."},{"key":"20_CR4","unstructured":"R. Milner. The polyadic \u03c0-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, October 1991."},{"key":"20_CR5","doi-asserted-by":"crossref","unstructured":"U. Nestmann. What is a \u2018good\u2019 encoding of guarded choice? In Proceedings of EXPRESS\u201997, volume 7 of ENTCS, 1997.","DOI":"10.1016\/S1571-0661(05)80474-8"},{"key":"20_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CONCUR\u2019 96","author":"U. Nestmann","year":"1996","unstructured":"U. Nestmann and B. C. Pierce. Decoding choice encodings. In Proceedings of CONCUR\u2019 96, number 1119. LNCS, Springer Verlag, August 1996."},{"issue":"6","key":"20_CR7","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 on Computing, 16(6):973\u2013989, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"20_CR8","unstructured":"B. C. Pierce and D. N. Turner. Pict: A Programming Language Based on the Pi-Calculus. Technical Report CSCI 476, Computer Science Department, Indiana University, 1997."},{"key":"20_CR9","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of MFCS\u2019 95","author":"D. Sangiorgi","year":"1995","unstructured":"D. Sangiorgi. On the bisimulation proof method. In Proceedings of MFCS\u2019 95, volume 969 of LNCS, 1995."},{"key":"20_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"D. Sangiorgi. A theory of bisimulation for the \u03c0-calculus. Acta Informatica, 33:69\u201397, 1996.","journal-title":"Acta Informatica"},{"key":"20_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/3-540-63165-8_187","volume-title":"Proceedings of ICALP\u2019 97","author":"D. Sangiorgi","year":"1997","unstructured":"D. Sangiorgi. The name discipline of uniform receptiveness. In Proceedings of ICALP\u2019 97, volume 1256 of LNCS, pages 303\u2013313, 1997."},{"key":"20_CR12","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of CAV\u201994","author":"B. Victor","year":"1994","unstructured":"B. Victor and F. Moller. The MobilityWorkbench\u2014a tool for the \u03c0-calculus. In D. Dill, editor, Proceedings of CAV\u201994, volume 818 of LNCS, pages 428-440. Springer-Verlag, 1994."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49059-0_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T11:00:08Z","timestamp":1556967608000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49059-0_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657033","9783540490593"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-49059-0_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}