{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:07:04Z","timestamp":1767236824936},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319405773"},{"type":"electronic","value":"9783319405780"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-40578-0_2","type":"book-chapter","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T16:25:20Z","timestamp":1467217520000},"page":"20-35","source":"Crossref","is-referenced-by-count":10,"title":["A Calculus for Local Reversibility"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Kuhn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irek","family":"Ulidowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,30]]},"reference":[{"key":"2_CR1","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624193","volume-title":"Process Algebra","author":"JCM Baeten","year":"1990","unstructured":"Baeten, J.C.M., Weijland, W.P.: Process Algebra. Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1990)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Laneve, C.: Reversible structures. In: 9th International Conference on Computational Methods in Systems Biology, pp. 131\u2013140. ACM (2011)","DOI":"10.1145\/2037509.2037529"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Cristescu, I., Krivine, J., Varacca, D.: A compositional semantics for the reversible pi-calculus. In: Proceedings of LICS 2013, pp. 388\u2013397. IEEE, Computer Society (2013)","DOI":"10.1109\/LICS.2013.45"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/978-3-540-28644-8_19","volume-title":"CONCUR 2004 - Concurrency Theory","author":"V Danos","year":"2004","unstructured":"Danos, V., Krivine, J.: Reversible communicating systems. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 292\u2013307. Springer, Heidelberg (2004)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Danos, V., Krivine, J.: Formal molecular biology done in CCS-R. In: Proceedings of the 1st Workshop on Concurrent Models in Molecular Biology BioConcur 2003, ENTCS, vol. 180, pp. 31\u201349 (2007)","DOI":"10.1016\/j.entcs.2004.01.040"},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.tcs.2004.03.065","volume":"325","author":"V Danos","year":"2004","unstructured":"Danos, V., Laneve, C.: Formal molecular biology. Theoret. Comput. Sci. 325(1), 69\u2013110 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-3-319-20860-2_19","volume-title":"Reversible Computation","author":"S Kuhn","year":"2015","unstructured":"Kuhn, S., Ulidowski, I.: Towards modelling of local reversibility. In: Krivine, J., Stefani, J.-B. (eds.) Reversible Computation. LNCS, vol. 9138, pp. 279\u2013284. Springer, Heidelberg (2015)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-642-23217-6_20","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"I Lanese","year":"2011","unstructured":"Lanese, I., Mezzina, C.A., Schmitt, A., Stefani, J.-B.: Controlling reversibility in higher-order pi. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 297\u2013311. Springer, Heidelberg (2011)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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. 6269, pp. 478\u2013493. Springer, Heidelberg (2010)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/978-3-642-36315-3_19","volume-title":"Reversible Computation","author":"I Lanese","year":"2013","unstructured":"Lanese, I., Mezzina, C.A., Stefani, J.-B.: Controlled reversibility and compensations. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 233\u2013240. Springer, Heidelberg (2013)"},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-10235-3","volume-title":"A Calculus for Communicating Systems","author":"R Milner","year":"1980","unstructured":"Milner, R.: A Calculus for Communicating Systems. LNCS, vol. 92. Springer, Heidelberg (1980)"},{"key":"2_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/11690634_17","volume-title":"Foundations of Software Science and Computation Structures","author":"I Phillips","year":"2006","unstructured":"Phillips, I., Ulidowski, I.: Reversing algebraic process calculi. In: Aceto, L., Ing\u00f3lfsd\u00f3ttir, A. (eds.) FOSSACS 2006. LNCS, vol. 3921, pp. 246\u2013260. Springer, Heidelberg (2006)"},{"key":"2_CR13","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.jlap.2006.11.002","volume":"73","author":"ICC Phillips","year":"2007","unstructured":"Phillips, I.C.C., Ulidowski, I.: Reversing algebraic process calculi. J. Log. Algebraic Program. 73, 70\u201396 (2007)","journal-title":"J. Log. Algebraic Program."},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/978-3-642-40184-8_22","volume-title":"CONCUR 2013 \u2013 Concurrency Theory","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I.: Reversibility and asymmetric conflict in event structures. In: D\u2019Argenio, P.R., Melgratti, H. (eds.) CONCUR 2013 \u2013 Concurrency Theory. LNCS, vol. 8052, pp. 303\u2013318. Springer, Heidelberg (2013)"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-642-38986-3_12","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: Modelling of bonding with processes and events. In: Dueck, G.W., Miller, D.M. (eds.) RC 2013. LNCS, vol. 7948, pp. 141\u2013154. Springer, Heidelberg (2013)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1007\/978-3-642-36315-3_18","volume-title":"Reversible Computation","author":"I Phillips","year":"2013","unstructured":"Phillips, I., Ulidowski, I., Yuen, S.: A reversible process calculus and the modelling of the ERK signalling pathway. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol. 7581, pp. 218\u2013232. Springer, Heidelberg (2013)"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Ulidowski, I.: Equivalences on observable processes. In: Proceedings of LICS 1992, pp. 148\u2013159. IEEE, Computer Science Press (1992)","DOI":"10.1109\/LICS.1992.185529"},{"key":"2_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-08494-7_1","volume-title":"Reversible Computation","author":"I Ulidowski","year":"2014","unstructured":"Ulidowski, I., Phillips, I., Yuen, S.: Concurrency and reversibility. In: Yamashita, S., Minato, S. (eds.) RC 2014. LNCS, vol. 8507, pp. 1\u201314. Springer, Heidelberg (2014)"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-40578-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,2]],"date-time":"2022-07-02T07:51:55Z","timestamp":1656748315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-40578-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319405773","9783319405780"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-40578-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}