{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,20]],"date-time":"2023-02-20T20:26:54Z","timestamp":1676924814336},"reference-count":24,"publisher":"Cambridge University Press (CUP)","issue":"1-2","license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2007,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this paper we compare three different formalisms that can be used in the area of models for distributed, concurrent and mobile systems. In particular we analyze the relationships between a process calculus, the <jats:italic>Fusion Calculus<\/jats:italic>, graph transformations in the <jats:italic>Synchronized Hyperedge Replacement<\/jats:italic> with Hoare synchronization (HSHR) approach and <jats:italic>logic programming<\/jats:italic>. We present a translation from Fusion Calculus into HSHR (whereas Fusion Calculus uses Milner synchronization) and prove a correspondence between the reduction semantics of Fusion Calculus and HSHR transitions. We also present a mapping from HSHR into a transactional version of logic programming and prove that there is a full correspondence between the two formalisms. The resulting mapping from Fusion Calculus to logic programming is interesting since it shows the tight analogies between the two formalisms, in particular for handling name generation and mobility. The intermediate step in terms of HSHR is convenient since graph transformations allow for multiple, remote synchronizations, as required by Fusion Calculus semantics.<\/jats:p>","DOI":"10.1017\/s147106840600281x","type":"journal-article","created":{"date-parts":[[2007,2,9]],"date-time":"2007-02-09T07:38:10Z","timestamp":1171006690000},"page":"123-151","source":"Crossref","is-referenced-by-count":3,"title":["Mapping Fusion and Synchronized Hyperedge Replacement into logic programming"],"prefix":"10.1017","volume":"7","author":[{"given":"IVAN","family":"LANESE","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"UGO","family":"MONTANARI","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2007,1,1]]},"reference":[{"key":"S147106840600281X_N10380","volume-title":"Foundations of Logic Programming","author":"Lloyd","year":"1993"},{"key":"S147106840600281X_N10273","first-page":"121","volume-title":"Proc. of CONCUR'01. LNCS, vol. 2154","author":"Hirsch","year":"2001"},{"key":"S147106840600281X_N10219","first-page":"484","volume-title":"Proc. of FoSSaCS'04. LNCS, vol. 2987","author":"Gardner","year":"2004"},{"key":"S147106840600281X_N103C0","volume-title":"Proc. of LICS'98","author":"Parrow","year":"1998"},{"key":"S147106840600281X_N102BC","first-page":"145","volume-title":"Proc. of TACS'01. LNCS, vol. 2215","author":"K\u00f6nig","year":"2001"},{"key":"S147106840600281X_N102FF","first-page":"11","volume-title":"Proc. SBES'2002 \u2013 16th Brazilian Symposium on Software Engineering","author":"Lanese","year":"2002"},{"key":"S147106840600281X_N10322","first-page":"199","volume-title":"Proc. of the Workshop of the COMETA Project on Computational Metamodels. Electronic Notes in Theoretical Computer Science, vol. 104","author":"Lanese","year":"2004"},{"key":"S147106840600281X_N102F1","unstructured":"Lanese I. 2006. Synchronization strategies for global computing models. Ph.D. thesis, Computer Science Department, University of Pisa, Pisa, Italy. Forthcoming."},{"key":"S147106840600281X_N1017D","volume-title":"Handbook of Graph Grammars and Computing by Graph Transformation","author":"Ehrig","year":"1999"},{"key":"S147106840600281X_N1012B","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068401000035"},{"key":"S147106840600281X_N10105","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1999.2819"},{"key":"S147106840600281X_N103FA","unstructured":"Victor B. 1998. The fusion calculus: Expressiveness and symmetry in mobile processes. Ph.D. thesis, Dept. of Computer Systems, Uppsala University, Sweden."},{"key":"S147106840600281X_N10397","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90008-4"},{"key":"S147106840600281X_N101D0","first-page":"1","volume-title":"Proc. of ICTCS'01. LNCS, vol. 2202","author":"Ferrari","year":"2001"},{"key":"S147106840600281X_N10157","doi-asserted-by":"publisher","DOI":"10.1145\/23005.24038"},{"key":"S147106840600281X_N10368","unstructured":"Lanese I. and Montanari U. 2005. Mapping fusion and synchronized hyperedge replacement into logic programming. Computing Research Repository (http:\/\/arxiv.org\/corr\/home). Paper n. cs.LO\/0504050."},{"key":"S147106840600281X_N1024A","first-page":"148","volume-title":"Proc. of COORDINATION 2000. LNCS, vol. 1906","author":"Hirsch","year":"2000"},{"key":"S147106840600281X_N101A7","first-page":"167","volume-title":"Proc. of IEEE Conference on Automata and Switching Theory","author":"Ehrig","year":"1973"},{"key":"S147106840600281X_N10296","doi-asserted-by":"publisher","DOI":"10.1145\/640128.604135"},{"key":"S147106840600281X_N103DD","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57208-2_10"},{"key":"S147106840600281X_N1023C","unstructured":"Hirsch D. 2003. Graph transformation models for software architecture styles. Ph.D. thesis, Departamento de Computaci\u00f3n, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina."},{"key":"S147106840600281X_N101F9","first-page":"373","volume-title":"Mathematical Foundations of Computer Science","author":"Gardner","year":"2000"},{"key":"S147106840600281X_N102DF","unstructured":"Lanese I. 2002. Process synchronization in distributed systems via Horn clauses. M.S. thesis, Computer Science Department, University of Pisa, Pisa, Italy. Downloadable from http:\/\/www.di.unipi.it\/~lanese\/tesi.ps."},{"key":"S147106840600281X_N10345","first-page":"43","volume-title":"Proc. of FGUC'04 \u2013 Foundations of Global Ubiquitous Computing. Electronic Notes in Theoretical Computer Science, vol. 138","author":"Lanese","year":"2004"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S147106840600281X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T16:47:38Z","timestamp":1554396458000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106840600281X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1]]},"references-count":24,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2007,1]]}},"alternative-id":["S147106840600281X"],"URL":"https:\/\/doi.org\/10.1017\/s147106840600281x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1]]}}}