{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:12:14Z","timestamp":1725563534993},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153747"},{"type":"electronic","value":"9783642153754"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_25","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T14:04:18Z","timestamp":1282313058000},"page":"358-372","source":"Crossref","is-referenced-by-count":1,"title":["Efficient Bisimilarities from Second-Order Reaction Semantics for \u03c0-Calculus"],"prefix":"10.1007","author":[{"given":"Pietro","family":"Di Gianantonio","sequence":"first","affiliation":[]},{"given":"Svetlana","family":"Jak\u0161i\u0107","sequence":"additional","affiliation":[]},{"given":"Marina","family":"Lenisa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44618-4_19","volume-title":"CONCUR 2000 - Concurrency Theory","author":"J.J. Leifer","year":"2000","unstructured":"Leifer, J.J., Milner, R.: Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol.\u00a01877, pp. 243\u2013258. Springer, Heidelberg (2000)"},{"key":"25_CR2","first-page":"163","volume":"10","author":"V. Sassone","year":"2003","unstructured":"Sassone, V., Sobocinski, P.: Deriving bisimulation congruences using 2-categories. Nord. J. Comput.\u00a010, 163\u2013190 (2003)","journal-title":"Nord. J. Comput."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Foundations of Software Science and Computational Structures","author":"G.L. Ferrari","year":"2005","unstructured":"Ferrari, G.L., Montanari, U., Tuosto, E.: Model checking for nominal calculi. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol.\u00a03441, pp. 1\u201324. Springer, Heidelberg (2005)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/11601548_9","volume-title":"Processes, Terms and Cycles: Steps on the Road to Infinity","author":"F. Gadducci","year":"2005","unstructured":"Gadducci, F., Montanari, U.: Observing reductions in nominal calculi via a graphical encoding of processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F., de Vrijer, R. (eds.) Processes, Terms and Cycles: Steps on the Road to Infinity. LNCS, vol.\u00a03838, pp. 106\u2013126. Springer, Heidelberg (2005)"},{"key":"25_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11841883_13","volume-title":"Graph Transformations","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., Gadducci, F., K\u00f6nig, B.: Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L., Rozenberg, G. (eds.) ICGT 2006. LNCS, vol.\u00a04178, pp. 168\u2013183. Springer, Heidelberg (2006)"},{"key":"25_CR6","first-page":"69","volume-title":"LICS","author":"F. Bonchi","year":"2006","unstructured":"Bonchi, F., K\u00f6nig, B., Montanari, U.: Saturated semantics for reactive systems. In: LICS, pp. 69\u201380. IEEE Computer Society, Los Alamitos (2006)"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-3-642-03429-9_9","volume-title":"WADT","author":"P. Gianantonio Di","year":"2009","unstructured":"Di Gianantonio, P., Honsell, F., Lenisa, M.: Finitely branching labelled transition systems from reaction semantics for process calculi. In: WADT. LNCS, vol.\u00a05486, pp. 119\u2013134. Springer, Heidelberg (2009)"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-642-00596-1_20","volume-title":"Foundations of Software Science and Computational Structures","author":"F. Bonchi","year":"2009","unstructured":"Bonchi, F., Gadducci, F., Monreale, G.V.: Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 272\u2013287. Springer, Heidelberg (2009)"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Di Gianantonio, P., Honsell, F., Lenisa, M.: RPO, second-order contexts, and lambda-calculus. Logical Methods in Computer Science\u00a05 (2009)","DOI":"10.2168\/LMCS-5(3:6)2009"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Jensen, O.H., Milner, R.: Bigraphs and transitions. In: POPL, pp. 38\u201349 (2003)","DOI":"10.1145\/604131.604135"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/j.entcs.2007.10.002","volume":"192","author":"P. Sobocinski","year":"2007","unstructured":"Sobocinski, P.: A well-behaved lts for the pi-calculus (abstract). Electr. Notes Theor. Comput. Sci.\u00a0192, 5\u201311 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Di Gianantonio, P., Jaksic, S., Lenisa, M.: Efficient bisimilarities from second-order reaction semantics for pi-calculus. Technical report, Universit\u00e0 di Udine (2010), http:\/\/sole.dimi.uniud.it\/~marina.lenisa\/Papers\/Soft-copy-pdf\/tr10.pdf","DOI":"10.1007\/978-3-642-15375-4_25"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/B978-044482830-9\/50026-6","volume-title":"Handbook of Process Algebra","author":"J. Parrow","year":"2001","unstructured":"Parrow, J.: An introduction to the pi-calculus. In: Bergstra, Ponse, Smolka (eds.) Handbook of Process Algebra, pp. 479\u2013543. Elsevier, Amsterdam (2001)"},{"key":"25_CR14","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 pi-calculus. Acta Inf.\u00a033, 69\u201397 (1996)","journal-title":"Acta Inf."}],"container-title":["Lecture Notes in Computer Science","CONCUR 2010 - Concurrency Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T00:24:18Z","timestamp":1559435058000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}