{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:57Z","timestamp":1761611157737,"version":"build-2065373602"},"reference-count":31,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":5323,"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":[[1999]]},"DOI":"10.1016\/s1571-0661(05)80309-3","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"80-100","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting"],"prefix":"10.1016","volume":"29","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reiko","family":"Heckel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Merc\u00e9","family":"Llabr\u00e9s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80309-3_BIB1","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF01692060","article-title":"Graph expressions and graph rewritings","volume":"20","author":"Bauderon","year":"1987","journal-title":"Mathematical Systems Theory"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB2","series-title":"Midwest Category Seminar, volume 47 of Lectures Notes in Mathematics","first-page":"1","article-title":"Introduction to bicategories","author":"B\u00e9nabou","year":"1967"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB3","unstructured":"D.B. Benson. The basic algebraic structures in categories of derivations."},{"key":"10.1016\/S1571-0661(05)80309-3_BIB4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0022-4049(84)90061-6","article-title":"Bicategories of spans and relations","volume":"33","author":"Carboni","year":"1984","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB5","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0022-4049(87)90121-6","article-title":"Cartesian bicategories I","volume":"49","author":"Carboni","year":"1987","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB6","series-title":"Graph Transformations in Computer Science, volume 776 of LNCS","first-page":"86","article-title":"Abstract graph derivations in the double-pushout approach","author":"Corradini","year":"1994"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB7","series-title":"Category Theory and Computer Science, volume 1290 of LNCS","first-page":"87","article-title":"A 2-categorical presentation of term graph rewriting","author":"Corradini","year":"1997"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB8","doi-asserted-by":"crossref","DOI":"10.1051\/ita:1999128","article-title":"Rewriting on cyclic structures: Equivalence between the operational and the categorical description","author":"Corradini","year":"1999","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB9","series-title":"Rewriting Techniques and Applications, volume 914 of LNCS","first-page":"225","article-title":"Relating two categorical models of term rewriting","author":"Corradini","year":"1995"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB10","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)80309-3_BIB11","series-title":"Handbook of Graph Grammars and Computing by Graph Transformation","article-title":"Algebraic approaches to graph transformation I: Basic concepts and double pushout approach","author":"Corradini","year":"1997"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB12","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1006\/aima.1997.1649","article-title":"Monoidal bicategories and Hopf algebroids","volume":"129","author":"Day","year":"1997","journal-title":"Advances in Mathematics"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB13","series-title":"Graph-Grammars and Their Application to Computer Science and Biology, volume 73 of LNCS","first-page":"1","article-title":"Introduction to the algebraic theory of graph grammars","author":"Ehrig","year":"1979"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB14","series-title":"Algebraic System Theory, volume 131 of Lecture Notes in Economics and Mathematical Systems","first-page":"323","article-title":"Categorical approach to graphic systems and graph grammars","author":"Ehrig","year":"1975"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB15","series-title":"Switching and Automata Theory","first-page":"167","article-title":"Graph-grammars: an algebraic approach","author":"Ehrig","year":"1973"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB16","series-title":"Recent Trends in Algebraic Development Techniques, volume 1376 of LNCS","first-page":"219","article-title":"An inductive view of graph transformation","author":"Gadducci","year":"1998"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB17","series-title":"volume 158 of Memoirs of the American Mathematical Society.","article-title":"Coherence for Tricategories","author":"Gordon","year":"1995"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB18","series-title":"PhD thesis, University of Edinburgh","article-title":"Models of Sharing Graphs","author":"Hasegawa","year":"1997"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB19","series-title":"PhD thesis, Technische Universit\u00e4t Berlins","article-title":"Open Graph Transformation Systems: A New Approach to the Compositional Modelling of Concurrent and Reactive Systems","author":"Heckel","year":"1998"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0022-4049(96)00012-6","article-title":"Bicategories of processes","volume":"115","author":"Katis","year":"1997","journal-title":"Journal of Pure and Applied Algebra"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB21","series-title":"Algebraic Methodology and Software Technology, volume 1349 of LNCS","first-page":"307","article-title":"SPAN(Graph): A categorical algebra of transition systems","author":"Katis","year":"1997"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB22","series-title":"Sydney Category Seminar, volume 420 of Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0063101","article-title":"Review of the elements of 2-categories","author":"Kelly","year":"1974"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB23","series-title":"PhD thesis, Technische Universit\u00e4t Berlin","article-title":"Manipulation von Graphmanipulationen","author":"Kreowski","year":"1977"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB24","unstructured":"T. Leinster. Basic bicategories. Available at http:\/\/can.dpmms.cam.ac.uk\/~leinster\/, 1998."},{"key":"10.1016\/S1571-0661(05)80309-3_BIB25","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":"Theoret. Comput. Sci."},{"key":"10.1016\/S1571-0661(05)80309-3_BIB26","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","article-title":"Petri nets are monoids","volume":"88","author":"Meseguer","year":"1990","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB27","series-title":"Category Theory and Computer Science, volume 389 of LNCS","first-page":"300","article-title":"An abstract formulation for rewrite systems","author":"Power","year":"1989"},{"year":"1997","series-title":"Handbook of Graph Grammars and Computing by Graph Transformation","key":"10.1016\/S1571-0661(05)80309-3_BIB28"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB29","series-title":"Category Theory and Computer Science, volume 283 of LNCS","first-page":"114","article-title":"Foundations of equational deductions: A categorical treatment of equational proofs and unification algorithms","author":"Rydehard","year":"1987"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB30","series-title":"PhD thesis, University of Manchester","article-title":"Categorical Aspects of Unification and Rewriting","author":"Stell","year":"1992"},{"key":"10.1016\/S1571-0661(05)80309-3_BIB31","series-title":"Handbook of Algebra","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/S1570-7954(96)80019-2","article-title":"Categorical structures","author":"Street","year":"1996"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803093?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:07:55Z","timestamp":1761610075000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"references-count":31,"alternative-id":["S1571066105803093"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80309-3","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Bi-Categorical Axiomatisation of Concurrent Graph Rewriting","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)80309-3","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}