{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T05:18:12Z","timestamp":1726031892007},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030214999"},{"type":"electronic","value":"9783030215002"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-21500-2_4","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T23:02:48Z","timestamp":1560726168000},"page":"51-66","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reversibility vs Local Creation\/Destruction"],"prefix":"10.1007","author":[{"given":"Pablo","family":"Arrighi","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Durbec","sequence":"additional","affiliation":[]},{"given":"Aur\u00e9lien","family":"Emmanuel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,23]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-642-31585-5_9","volume-title":"Automata, Languages, and Programming","author":"P Arrighi","year":"2012","unstructured":"Arrighi, P., Dowek, G.: Causal graph dynamics. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7392, pp. 54\u201366. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31585-5_9"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.jcss.2010.05.004","volume":"77","author":"P Arrighi","year":"2010","unstructured":"Arrighi, P., Nesme, V., Werner, R.: Unitarity plus causality implies localizability. J. Comput. Syst. Sci. 77, 372\u2013378 (2010). QIP 2010 (long talk)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ic.2012.10.019","volume":"223","author":"P Arrighi","year":"2013","unstructured":"Arrighi, P., Dowek, G.: Causal graph dynamics (long version). Inf. Comput. 223, 78\u201393 (2013)","journal-title":"Inf. Comput."},{"key":"4_CR4","unstructured":"Arrighi, P., Durbec, N., Emmanuel, A.: Reversibility vs local creation\/destruction. CoRR, abs\/1805.10330 (2018). http:\/\/arxiv.org\/abs\/1805.10330"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"024026","DOI":"10.1103\/PhysRevD.96.024026","volume":"96","author":"P Arrighi","year":"2017","unstructured":"Arrighi, P., Martiel, S.: Quantum causal graph dynamics. Phys. Rev. D 96, 024026 (2017). https:\/\/doi.org\/10.1103\/PhysRevD.96.024026","journal-title":"Phys. Rev. D"},{"issue":"3","key":"4_CR6","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1017\/S0960129517000044","volume":"28","author":"P Arrighi","year":"2018","unstructured":"Arrighi, P., Martiel, S., Nesme, V.: Cellular automata over generalized cayley graphs. Math. Struct. Comput. Sci. 28(3), 340\u2013383 (2018). https:\/\/doi.org\/10.1017\/S0960129517000044","journal-title":"Math. Struct. Comput. Sci."},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-319-22177-9_27","volume-title":"Fundamentals of Computation Theory","author":"P Arrighi","year":"2015","unstructured":"Arrighi, P., Martiel, S., Perdrix, S.: Block representation of reversible causal graph dynamics. In: Kosowski, A., Walukiewicz, I. (eds.) FCT 2015. LNCS, vol. 9210, pp. 351\u2013363. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22177-9_27"},{"key":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-319-40578-0_5","volume-title":"Reversible Computation","author":"P Arrighi","year":"2016","unstructured":"Arrighi, P., Martiel, S., Perdrix, S.: Reversible causal graph dynamics. In: Devitt, S., Lanese, I. (eds.) RC 2016. LNCS, vol. 9720, pp. 73\u201388. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40578-0_5"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"241","DOI":"10.4171\/JEMS\/196","volume":"12","author":"L Bartholdi","year":"2010","unstructured":"Bartholdi, L.: Gardens of Eden and amenability on cellular automata. J. Eur. Math. Soc. 12(1), 241\u2013248 (2010)","journal-title":"J. Eur. Math. Soc."},{"issue":"2\u20133","key":"4_CR10","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0022-0000(87)90030-4","volume":"34","author":"P Boehm","year":"1987","unstructured":"Boehm, P., Fonio, H.R., Habel, A.: Amalgamation of graph transformations: a synchronization mechanism. J. Comput. Syst. Sci. 34(2\u20133), 377\u2013408 (1987)","journal-title":"J. Comput. Syst. Sci."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-1-4614-6825-7_12","volume-title":"Search Theory","author":"J Chalopin","year":"2013","unstructured":"Chalopin, J., Das, S., Widmayer, P.: Deterministic symmetric rendezvous in arbitrary graphs: overcoming anonymity, failures and uncertainty. In: Alpern, S., Fokkink, R., G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V. (eds.) Search Theory, pp. 175\u2013195. Springer, Berlin (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6825-7_12"},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","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. Theor. Comput. Sci. 325(1), 69\u2013110 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2004.03.065 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397504002336 . Computational Systems Biology","journal-title":"Theor. Comput. Sci."},{"key":"4_CR13","first-page":"154","volume":"145","author":"JO Durand-Lose","year":"2001","unstructured":"Durand-Lose, J.O.: Representing reversible cellular automata with reversible block cellular automata. Discrete Math. Theor. Comput. Sci. 145, 154 (2001)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1\u20132","key":"4_CR14","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0304-3975(93)90066-3","volume":"109","author":"H Ehrig","year":"1993","unstructured":"Ehrig, H., Lowe, M.: Parallel and distributed derivations in the single-pushout approach. Theor. Comput. Sci. 109(1\u20132), 123\u2013143 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Ceccherini-Silberstein, T., Fiorenzi, F., Scarabotti, F.: The garden of Eden theorem for cellular automata and for symbolic dynamical systems. In: Random Walks and Geometry. Proceedings of a Workshop at the Erwin Schr\u00f6dinger Institute, Vienna, 18 June\u201313 July 2001. Collaboration with Klaus Schmidt and Wolfgang Woess. Collected papers, pp. 73\u2013108. de Gruyter, Berlin (2004)","DOI":"10.1515\/9783110198089.1.73"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-61464-8","volume-title":"Rewriting Techniques and Applications","year":"1996","unstructured":"Ganzinger, H. (ed.): RTA 1996. LNCS, vol. 1103. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61464-8"},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/pl00011162","volume":"1","author":"M Gromov","year":"1999","unstructured":"Gromov, M.: Endomorphisms of symbolic algebraic varieties. J. Eur. Math. Soc. 1(2), 109\u2013197 (1999). https:\/\/doi.org\/10.1007\/pl00011162","journal-title":"J. Eur. Math. Soc."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Hamma, A., et al.: A quantum Bose-Hubbard model with evolving graph as toy model for emergent spacetime. Arxiv preprint arXiv:0911.5075 (2009)","DOI":"10.1103\/PhysRevD.81.104032"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Hasslacher, B., Meyer, D.A.: Modelling dynamical geometry with lattice gas automata. Expanded Version of a Talk Presented at the Seventh International Conference on the Discrete Simulation of Fluids Held at the University of Oxford, June 1998","DOI":"10.1142\/S0129183198001448"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"GA Hedlund","year":"1969","unstructured":"Hedlund, G.A.: Endomorphisms and automorphisms of the shift dynamical system. Math. Syst. Theory 3, 320\u2013375 (1969)","journal-title":"Math. Syst. Theory"},{"key":"4_CR21","doi-asserted-by":"crossref","unstructured":"Kari, J.: Reversibility of 2D cellular automata is undecidable. In: Cellular Automata: Theory and Experiment, vol. 45, pp. 379\u2013385. MIT Press (1991)","DOI":"10.1016\/0167-2789(90)90195-U"},{"issue":"1","key":"4_CR22","first-page":"47","volume":"29","author":"J Kari","year":"1996","unstructured":"Kari, J.: Representation of reversible cellular automata with block permutations. Theory Comput. Syst. 29(1), 47\u201361 (1996)","journal-title":"Theory Comput. Syst."},{"issue":"1\u20132","key":"4_CR23","doi-asserted-by":"crossref","first-page":"93","DOI":"10.3233\/FI-1999-381208","volume":"38","author":"J Kari","year":"1999","unstructured":"Kari, J.: On the circuit depth of structurally reversible cellular automata. Fundam. Inf. 38(1\u20132), 93\u2013107 (1999)","journal-title":"Fundam. Inf."},{"issue":"4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"046705","DOI":"10.1103\/PhysRevE.82.046705","volume":"82","author":"A Klales","year":"2010","unstructured":"Klales, A., Cianci, D., Needell, Z., Meyer, D.A., Love, P.J.: Lattice gas simulations of dynamical geometry in two dimensions. Phys. Rev. E 82(4), 046705 (2010). https:\/\/doi.org\/10.1103\/PhysRevE.82.046705","journal-title":"Phys. Rev. E"},{"key":"4_CR25","unstructured":"Konopka, T., Markopoulou, F., Smolin, L.: Quantum graphity. Arxiv preprint hep-th\/0611197 (2006)"},{"key":"4_CR26","unstructured":"Maignan, L., Spicher, A.: Global graph transformations. In: Proceedings of the 6th International Workshop on Graph Computation Models, L\u2019Aquila, Italy, 20 July 2015, pp. 34\u201349 (2015)"},{"key":"4_CR27","doi-asserted-by":"publisher","unstructured":"Martiel, S., Martin, B.: Intrinsic universality of causal graph dynamics. In: Neary, T., Cook, M. (eds.) Electronic Proceedings in Theoretical Computer Science, Proceedings, Machines, Computations and Universality 2013, Z\u00fcrich, Switzerland, 9 September 2013\u201311 September 2013, vol. 128, pp. 137\u2013149. Open Publishing Association (2013). https:\/\/doi.org\/10.4204\/EPTCS.128.19","DOI":"10.4204\/EPTCS.128.19"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/3-540-45465-9_29","volume-title":"Automata, Languages and Programming","author":"C Papazian","year":"2002","unstructured":"Papazian, C., R\u00e9mila, E.: Hyperbolic recognition by graph automata. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 330\u2013342. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_29"},{"key":"4_CR29","unstructured":"Schumacher, B., Werner, R.: Reversible quantum cellular automata. arXiv pre-print quant-ph\/0405174 (2004)"},{"issue":"2","key":"4_CR30","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1103\/PhysRevD.12.385","volume":"12","author":"R Sorkin","year":"1975","unstructured":"Sorkin, R.: Time-evolution problem in Regge calculus. Phys. Rev. D. 12(2), 385\u2013396 (1975)","journal-title":"Phys. Rev. D."},{"issue":"1\u20132","key":"4_CR31","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0304-3975(96)00215-0","volume":"186","author":"G Taentzer","year":"1997","unstructured":"Taentzer, G.: Parallel high-level replacement systems. Theor. Comput. Sci. 186(1\u20132), 43\u201381 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"4_CR32","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0167-2789(02)00601-2","volume":"171","author":"K Tomita","year":"2002","unstructured":"Tomita, K., Kurokawa, H., Murata, S.: Graph automata: natural expression of self-reproduction. Phys. D: Nonlinear Phenom. 171(4), 197\u2013210 (2002). https:\/\/doi.org\/10.1016\/S0167-2789(02)00601-2 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167278902006012","journal-title":"Phys. D: Nonlinear Phenom."}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21500-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T06:21:25Z","timestamp":1609914085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21500-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030214999","9783030215002"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21500-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lausanne","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Switzerland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/reversible-computation.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"55% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"One invited paper is included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}