{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T19:05:12Z","timestamp":1694631912895},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"4-5","license":[{"start":{"date-parts":[[2008,7,1]],"date-time":"2008-07-01T00:00:00Z","timestamp":1214870400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form. Asp. Comput."],"published-print":{"date-parts":[[2008,7]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In this paper, we investigate the connection between fragments of associative-commutative Term Rewriting and fragments of Mobile Ambients, a powerful model for mobile and distributed computations. The connection can be used to transfer decidability and undecidability results for important computational properties like reachability from one formalism to the other. Furthermore, it can be viewed as a vehicle to apply tools based on rewriting for the simulation and validation of specifications given in Mobile Ambients.<\/jats:p>","DOI":"10.1007\/s00165-008-0081-8","type":"journal-article","created":{"date-parts":[[2008,5,6]],"date-time":"2008-05-06T12:27:03Z","timestamp":1210076823000},"page":"407-428","source":"Crossref","is-referenced-by-count":2,"title":["Reachability analysis of fragments of mobile ambients in AC term rewriting"],"prefix":"10.1145","volume":"20","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica e Scienze dell\u2019Informazione, Universit\u00e0 di Genova, via Dodecaneso 35, 16143, Genova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto","family":"Montagna","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica e Scienze dell\u2019Informazione, Universit\u00e0 di Genova, via Dodecaneso 35, 16143, Genova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"e_1_2_1_2_1_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.020"},{"key":"e_1_2_1_2_2_2","doi-asserted-by":"crossref","unstructured":"Bugliesi M Castagna G Crafa S (2001) Boxed ambients. In: Proceeding of TACS 2001 pp 38\u201363","DOI":"10.1007\/3-540-45500-0_2"},{"key":"e_1_2_1_2_3_2","doi-asserted-by":"crossref","unstructured":"Busi N Zavattaro G (2005) Deciding reachability in mobile ambients. In: Proceedings of ESOP 2005 pp 248\u2013262","DOI":"10.1007\/978-3-540-31987-0_18"},{"key":"e_1_2_1_2_4_2","doi-asserted-by":"crossref","unstructured":"Busi N Zavattaro G (2005) Deciding reachability in boxed ambients. In: Proceedings of ICTCS 2005 pp 143\u2013159","DOI":"10.1007\/11560586_12"},{"key":"e_1_2_1_2_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00231-5"},{"key":"e_1_2_1_2_6_2","doi-asserted-by":"crossref","unstructured":"Coquid\u00e9 J-L Dauchet M Gilleron R V\u00e1gv\u00f6lgyi S (1991) Bottom-Up tree pushdown automata and rewrite systems. In: Proceedings of RTA 1991 pp 287\u2013298","DOI":"10.1007\/3-540-53904-2_104"},{"key":"e_1_2_1_2_7_2","doi-asserted-by":"crossref","unstructured":"Delzanno G Montagna R (2006) Reachability analysis of mobile ambients in fragments of AC term rewriting. In: Proceedings of ICTAC 2006. pp 302\u2013316","DOI":"10.1007\/11921240_21"},{"key":"e_1_2_1_2_8_2","unstructured":"Dauchet M Tison S (1990) The theory of ground rewrite systems is decidable. In: Proceedings of LICS 1990 pp 242\u2013248"},{"issue":"3","key":"e_1_2_1_2_9_2","first-page":"501","article-title":"Reachability analysis over term rewriting systems","volume":"330","author":"Feuillade G","year":"2005","journal-title":"Theor Comput Sci"},{"key":"e_1_2_1_2_10_2","doi-asserted-by":"crossref","unstructured":"Jacquemard F (1996) Decidable approximations of term rewriting systems. In: Proceedings of RTA 1996 pp 362\u2013376","DOI":"10.1007\/3-540-61464-8_65"},{"key":"e_1_2_1_2_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/596980.596981"},{"key":"e_1_2_1_2_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.10.007"},{"key":"e_1_2_1_2_13_2","doi-asserted-by":"crossref","unstructured":"Mayr EW (1984) An algorithm for the general petri net reachability problem. SIAM J Comput","DOI":"10.1137\/0213029"},{"key":"e_1_2_1_2_14_2","unstructured":"Mayr R Rusinowitch M (1998) Reachability is decidable for ground AC rewrite systems. In: Proceedings of Infinity 1998"},{"key":"e_1_2_1_2_15_2","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2826"},{"key":"e_1_2_1_2_16_2","doi-asserted-by":"crossref","unstructured":"Rao Kosaraju S (1982) Decidability of reachability in vector addition systems. In: Proceeding of Fourteenth Annual ACM Symposium on Theory of Computing pp 267\u2013281","DOI":"10.1145\/800070.802201"},{"key":"e_1_2_1_2_17_2","volume-title":"Petri nets\u2014an introduction, eatcs monographs on theoretical computer science, vol 4","author":"Reisig W","year":"1985"},{"key":"e_1_2_1_2_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90014-1"}],"container-title":["Formal Aspects of Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00165-008-0081-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00165-008-0081-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1007\/s00165-008-0081-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,6]],"date-time":"2022-01-06T15:47:16Z","timestamp":1641484036000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1007\/s00165-008-0081-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7]]},"references-count":18,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["10.1007\/s00165-008-0081-8"],"URL":"https:\/\/doi.org\/10.1007\/s00165-008-0081-8","relation":{},"ISSN":["0934-5043","1433-299X"],"issn-type":[{"value":"0934-5043","type":"print"},{"value":"1433-299X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7]]}}}