{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:14Z","timestamp":1759638314831},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76637-7_25","type":"book-chapter","created":{"date-parts":[[2007,11,20]],"date-time":"2007-11-20T02:47:52Z","timestamp":1195526872000},"page":"367-382","source":"Crossref","is-referenced-by-count":7,"title":["A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract"],"prefix":"10.1007","author":[{"given":"Alwen","family":"Tiu","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"25_CR1","first-page":"267","volume":"5","author":"M. Abadi","year":"1998","unstructured":"Abadi, M., Gordon, A.D.: A bisimulation method for cryptographic protocols. Nord. J. Comput.\u00a05(4), 267\u2013303 (1998)","journal-title":"Nord. J. Comput."},{"issue":"1","key":"25_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Information and Computation\u00a0148(1), 1\u201370 (1999)","journal-title":"Information and Computation"},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/3-540-48224-5_55","volume-title":"Automata, Languages and Programming","author":"M. Boreale","year":"2001","unstructured":"Boreale, M.: Symbolic trace analysis of cryptographic protocols. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds.) ICALP 2001. LNCS, vol.\u00a02076, pp. 667\u2013681. Springer, Heidelberg (2001)"},{"issue":"3","key":"25_CR4","doi-asserted-by":"publisher","first-page":"947","DOI":"10.1137\/S0097539700377864","volume":"31","author":"M. Boreale","year":"2002","unstructured":"Boreale, M., Nicola, R.D., Pugliese, R.: Proof techniques for cryptographic processes. SIAM Journal of Computing\u00a031(3), 947\u2013986 (2002)","journal-title":"SIAM Journal of Computing"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-540-28644-8_11","volume-title":"CONCUR 2004 - Concurrency Theory","author":"J. Borgstr\u00f6m","year":"2004","unstructured":"Borgstr\u00f6m, J., Briais, S., Nestmann, U.: Symbolic bisimulation in the spi calculus. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol.\u00a03170, pp. 161\u2013176. Springer, Heidelberg (2004)"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1017\/S0960129505004706","volume":"15","author":"J. Borgstr\u00f6m","year":"2005","unstructured":"Borgstr\u00f6m, J., Nestmann, U.: On bisimulations for the spi calculus. Mathematical Structures in Computer Science\u00a015(3), 487\u2013552 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"key":"25_CR7","unstructured":"Briais, S.: A symbolic characterisation of open bisimulation for the spi calculus. Technical Report LAMP-REPORT-2007-002, \u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne (2007)"},{"issue":"3","key":"25_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.entcs.2006.05.010","volume":"154","author":"S. Briais","year":"2006","unstructured":"Briais, S., Nestmann, U.: Open bisimulation, revisited. Electr. Notes Theor. Comput. Sci.\u00a0154(3), 109\u2013123 (2006)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Milner, R., Parrow, J., Walker, D.: A calculus of mobile processes, Part II. Information and Computation, pp. 41\u201377 (1992)","DOI":"10.1016\/0890-5401(92)90009-5"},{"issue":"1","key":"25_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D. Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the \u03c0-calculus. Acta Informatica\u00a033(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"25_CR11","unstructured":"Tiu, A.: A trace based bisimulation for the spi calculus. (2007), Preprint, available on \n                      \n                        http:\/\/rsise.anu.edu.au\/~tiu\/tbisim.pdf"}],"container-title":["Lecture Notes in Computer Science","Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76637-7_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:24Z","timestamp":1619506584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76637-7_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766360"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76637-7_25","relation":{},"subject":[]}}