{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:58Z","timestamp":1761611158142,"version":"build-2065373602"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":6053,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[1997]]},"DOI":"10.1016\/s1571-0661(05)80470-0","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"115-140","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":6,"special_numbering":"C","title":["Tiles for Concurrent and Located Calculi"],"prefix":"10.1016","volume":"7","author":[{"given":"GianLuigi","family":"Ferrari","sequence":"first","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocab":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80470-0_BIB1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","article-title":"Equational Term Graph Rewriting","volume":"26","author":"Ariola","year":"1996","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB2","series-title":"Acta Informatica 32 (7)","first-page":"647","article-title":"Trace Nets and Process Automata","author":"Badouel","year":"1995"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB3","doi-asserted-by":"crossref","unstructured":"H.P. Barendregt, M.C.J.D. van Eekelrn, J.R.W. Glauert, J.R. Kennaway, M.J. Plasmeijer, M.R. Sleep, Term Graph Reduction, Proc. PARLE, Springer LNCS 259, 141-158, 1987.","DOI":"10.1007\/3-540-17945-3_8"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB4","series-title":"Theoretical Computer Science, 114:","first-page":"31","article-title":"Observing Localities","author":"Boudol","year":"1993"},{"issue":"2","key":"10.1016\/S1571-0661(05)80470-0_BIB5","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1006\/inco.1994.1088","article-title":"Flow Models of Distributed Computations: Three Equivalent Semantics for CCS","volume":"114","author":"Boudol","year":"1994","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB6","doi-asserted-by":"crossref","unstructured":"R. Bruni, U. Montanari, Zero-Safe Nets, or Transition Synchronization Made Simple, to appear in Proc. Express'97, Santa Margherita, September 1997.","DOI":"10.1016\/S1571-0661(05)80466-9"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB7","unstructured":"A. Corradini, H. Ehrig, M. L\u00f6we, U. Montanari, F. Rossi, Abstract Approach to Graph Transformation \u2014 Part I: Basic Concepts and Double Pushout Approach, in: G Rozenberg, Ed., The Handbook of Graph Grammars and Computing by Graph Transformation, Vol.1: Foundations."},{"key":"10.1016\/S1571-0661(05)80470-0_BIB8","series-title":"submitted for publication. Available at http:\/\/www.di.unipi.it\/gadducci\/papers\/aptg.ps","article-title":"An Algebraic Presentation of Term Graphs via Gs-Monoidal Categories","author":"Corradini","year":"1997"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB9","doi-asserted-by":"crossref","unstructured":"A. Corradini, F. Gadducci, A 2-Categorical Presentation of Term Graph Rewriting, Proc. CTCS'97, Springer LNCS, to appear, 1997.","DOI":"10.1007\/BFb0026983"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB10","doi-asserted-by":"crossref","unstructured":"F. Corradini, R. De Nicola, Distribution and Locality of Concurrent Systems, in Proc. ICALP'94, LNCS 920, pages 154-165. Springer Verlag, 1994.","DOI":"10.1007\/3-540-58201-0_65"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB11","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0304-3975(92)90087-V","article-title":"An Algebraic Semantics for Structured Transition Systems and its Application to Logic Programs","volume":"103","author":"Corradini","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB12","doi-asserted-by":"crossref","unstructured":"P. Darondeau, P. Degano, Causal Trees, In: Proc. ICALP 89, LNCS, Vol. 372, 1989.","DOI":"10.1007\/BFb0035764"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB13","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0013030","article-title":"Partial Ordering Descriptions and Observations of Nondeterministic Concurrent Processes","volume":"354","author":"Degano","year":"1989","journal-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS"},{"issue":"7","key":"10.1016\/S1571-0661(05)80470-0_BIB14","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s002360050064","article-title":"Axiomatizing the Algebra of Net Computations and Processes","volume":"Vol.33","author":"Degano","year":"1996","journal-title":"Acta Informatica"},{"key":"#cr-split#-10.1016\/S1571-0661(05)80470-0_BIB15.1","doi-asserted-by":"crossref","unstructured":"C. Ehresmann, Cat\u00e9gories Structur\u00e9es: I and II, Ann. \u00c9c. Norm. Sup. 80, Paris (1963), 349-426","DOI":"10.24033\/asens.1125"},{"key":"#cr-split#-10.1016\/S1571-0661(05)80470-0_BIB15.2","unstructured":"III, Topo. et G\u00e9o. diff. V, Paris (1963)."},{"key":"10.1016\/S1571-0661(05)80470-0_BIB16","doi-asserted-by":"crossref","unstructured":"G. Ferrari, U. Montanari, Towards the Unification of Models for Concurrency, in Proc. Colloqium on Trees and Algebra of Programming (CAAP 90), LNCS 431, 162-176, 1990.","DOI":"10.1007\/3-540-52590-4_47"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB17","doi-asserted-by":"crossref","unstructured":"G. Ferrari, U. Montanari, A Tile-Based Coordination View of the Asynchronous \u03c0-calculus, to appear in Proc. MFCS'97, Springer LNCS, 1997.","DOI":"10.1007\/BFb0029949"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB18","unstructured":"F. Gadducci, On the Algebraic Approach to Concurrent Term Rewriting, PhD Thesis, Universit\u00e0 di Pisa, Pisa, Technical Report TD-96-02, Department of Computer Science, University of Pisa, 1996."},{"key":"10.1016\/S1571-0661(05)80470-0_BIB19","unstructured":"F. Gadducci, U. Montanari, The Tile Model, Technical Report TR-96-27, Department of Computer Science, University of Pisa, 1996."},{"key":"10.1016\/S1571-0661(05)80470-0_BIB20","doi-asserted-by":"crossref","unstructured":"F. Gadducci, U. Montanari, Tiles, Rewriting Rules and CCS, in Proc. 1st international workshop on Rewriting Logic and Applications, J. Meseguer Ed., ENTCS 4 (1996), pp.1-19.","DOI":"10.1016\/S1571-0661(04)00030-1"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)00073-R","article-title":"On the Implementation of Concurrent Calculi into Net Calculi: Two Case Studies","volume":"141","author":"Gorrieri","year":"1995","journal-title":"TCS"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB22","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/BF01178730","article-title":"Local and Global Causes","volume":"31","author":"Kiehn","year":"1994","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB23","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1017\/S0960129500000980","article-title":"Axiomatizing Permutation Equivalence","volume":"vol.6","author":"Laneve","year":"1996","journal-title":"Math. Struct, in Comp. Sc."},{"key":"10.1016\/S1571-0661(05)80470-0_BIB24","doi-asserted-by":"crossref","unstructured":"K.G. Larsen, L. Xinxin, Compositionality Through an Operational Semantics of Contexts, in Journal of Logic and Computation, vol.1, n.6, 1991 (conference version in Proc. ICALP'90, Springer-Verlag, LNCS 443, 1990).","DOI":"10.1093\/logcom\/1.6.761"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB25","doi-asserted-by":"crossref","unstructured":"F. W. Lawvere, Functorial Semantics of Algebraic Theories, Proc. National Academy of Science 50, 1963, pp. 869-872.","DOI":"10.1073\/pnas.50.5.869"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB26","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","article-title":"Conditional Rewriting Logic as a Unified Model of Concurrency","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A Calculus of Mobile Processes,(parts I and II)","volume":"100","author":"Milner","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB28","doi-asserted-by":"crossref","unstructured":"U. Montanari, M. Pistore, D. Yankelevich, Efficient Minimization up to Location Equivalence, in Proc. ESOP'96, LNCS 1058. Springer Verlag, 1996.","DOI":"10.1007\/3-540-61055-3_42"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB29","first-page":"12","article-title":"Graph Rewriting and Constraint Solving for Modelling Distributed Systems with Synchronization, in:","volume":"1061","author":"Montanari","year":"1996"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB30","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(94)00219-9","article-title":"Location Equivalence in a Parametric Setting","volume":"149","author":"Montanari","year":"1995","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80470-0_BIB31","unstructured":"G. Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804700?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105804700?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:06:53Z","timestamp":1761610013000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105804700"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"references-count":32,"alternative-id":["S1571066105804700"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80470-0","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Tiles for Concurrent and Located Calculi","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80470-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1997 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}