{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:23:51Z","timestamp":1725791031374},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642548291"},{"type":"electronic","value":"9783642548307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54830-7_21","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T09:30:31Z","timestamp":1395394231000},"page":"320-334","source":"Crossref","is-referenced-by-count":4,"title":["Bisimulations for Communicating Transactions"],"prefix":"10.1007","author":[{"given":"Vasileios","family":"Koutavas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlo","family":"Spaccasassi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Hennessy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"IFIP","first-page":"563","volume-title":"TCS 2004","author":"R. Bruni","year":"2004","unstructured":"Bruni, R., Melgratti, H.C., Montanari, U.: Nested commits for mobile calculi: extending Join. In: Levy, J.-J., Mayr, E.W., Mitchell, J.C. (eds.) TCS 2004. IFIP, vol.\u00a0155, pp. 563\u2013576. Springer, Boston (2004)"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/11539452_31","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"V. Danos","year":"2005","unstructured":"Danos, V., Krivine, J.: Transactions in RCCS. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 398\u2013412. Springer, Heidelberg (2005)"},{"key":"21_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1007\/978-3-642-15375-4_39","volume-title":"CONCUR 2010 - Concurrency Theory","author":"E. Vries de","year":"2010","unstructured":"de Vries, E., Koutavas, V., Hennessy, M.: Communicating transactions. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 569\u2013583. Springer, Heidelberg (2010)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/978-3-642-17164-2_27","volume-title":"Programming Languages and Systems","author":"E. Vries de","year":"2010","unstructured":"de Vries, E., Koutavas, V., Hennessy, M.: Liveness of communicating transactions (Extended abstract). In: Ueda, K. (ed.) APLAS 2010. LNCS, vol.\u00a06461, pp. 392\u2013407. Springer, Heidelberg (2010)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Donnelly, K., Fluet, M.: Transactional events. In: ICFP, pp. 124\u2013135. ACM (2006)","DOI":"10.1145\/1160074.1159821"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Effinger-Dean, L., Kehrt, M., Grossman, D.: Transactional events for ML. In: ICFP, pp. 103\u2013114. ACM (2008)","DOI":"10.1145\/1411203.1411222"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Field, J., Varela, C.A.: Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments. In: POPL, pp. 195\u2013208. ACM (2005)","DOI":"10.1145\/1047659.1040322"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1007\/978-3-642-36315-3_17","volume-title":"Reversible Computation","author":"J. Krivine","year":"2013","unstructured":"Krivine, J.: A verification technique for reversible process algebra. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol.\u00a07581, pp. 204\u2013217. Springer, Heidelberg (2013)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"370","DOI":"10.1007\/978-3-642-37036-6_21","volume-title":"Programming Languages and Systems","author":"I. Lanese","year":"2013","unstructured":"Lanese, I., Lienhardt, M., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Concurrent flexible reversibility. In: Felleisen, M., Gardner, P. (eds.) ESOP 2013. LNCS, vol.\u00a07792, pp. 370\u2013390. Springer, Heidelberg (2013)"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-15375-4_33","volume-title":"CONCUR 2010 - Concurrency Theory","author":"I. Lanese","year":"2010","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Reversing higher-order pi. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 478\u2013493. Springer, Heidelberg (2010)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Lesani, M., Palsberg, J.: Communicating memory transactions. In: PPoPP, pp. 157\u2013168. ACM (2011)","DOI":"10.1145\/2038037.1941577"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus of Communication Systems","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A Calculus of Communication Systems. LNCS, vol.\u00a092. Springer, Heidelberg (1980)"},{"issue":"1","key":"21_CR13","first-page":"93","volume":"192","author":"I. Phillips","year":"2007","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and models for concurrency. ENTCS\u00a0192(1), 93\u2013108 (2007) (SOS 2007)","journal-title":"ENTCS"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Sangiorgi, D., Kobayashi, N., Sumii, E.: Environmental bisimulations for higher-order languages. In: LICS, pp. 293\u2013302. IEEE Computer Society (2007)","DOI":"10.1109\/LICS.2007.17"},{"key":"21_CR15","unstructured":"Sangiorgi, D., Walker, D.: The \u03c0-calculus: a Theory of Mobile Processes. Cambridge University Press (2001)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-45340-3_5","volume-title":"Trends in Functional Programming","author":"C. Spaccasassi","year":"2014","unstructured":"Spaccasassi, C., Koutavas, V.: Towards efficient abstractions for concurrent consensus. In: McCarthy, J. (ed.) TFP 2013. LNCS, vol.\u00a08322, pp. 76\u201390. Springer, Heidelberg (2014)"},{"issue":"6","key":"21_CR17","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/BF02946488","volume":"13","author":"C. Stirling","year":"1998","unstructured":"Stirling, C.: Playing games and proving properties of concurrent systems. J. Comput. Sci. Technol.\u00a013(6), 482 (1998)","journal-title":"J. Comput. Sci. Technol."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54830-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:00:33Z","timestamp":1558857633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54830-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642548291","9783642548307"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54830-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}