{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:25:18Z","timestamp":1761611118296},"reference-count":59,"publisher":"EDP Sciences","issue":"4-5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[1999,7]]},"DOI":"10.1051\/ita:1999128","type":"journal-article","created":{"date-parts":[[2003,11,14]],"date-time":"2003-11-14T15:07:12Z","timestamp":1068822432000},"page":"467-493","source":"Crossref","is-referenced-by-count":21,"title":["Rewriting on cyclic structures: Equivalence between the operational and the categorical description"],"prefix":"10.1051","volume":"33","author":[{"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2002,8,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.3233\/FI-1996-263401","volume":"26","author":"Ariola","year":"1996","journal-title":"Fund. Inform."},{"key":"R2","unstructured":"Z.M. Ariola, J.W. Klop and D. Plump, Confluent rewriting of bisimilar term graphs, C. Palamidessi and J. Parrow, Eds.,Expressiveness in Concurrency. Elsevier Sciences,Electron. Notes Theoret. Comput. Sci.7(1997). Available at http:\/\/www.elsevier.nl\/locate\/entcs\/volume7.html\/."},{"key":"R3","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-17945-3_8","volume":"259","author":"Barendregt","year":"1987","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1051\/ita\/1998321-300351","volume":"32","author":"Bern\u00e1tsky","year":"1998","journal-title":"Theoret. Informatics Appl."},{"key":"R5","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1145\/322108.322122","volume":"26","author":"Berry","year":"1979","journal-title":"J. ACM"},{"key":"R6","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0022-0000(85)90059-5","volume":"31","author":"Bloom","year":"1985","journal-title":"J. Comput. System Sci."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"S. Bloom and Z. \u00c9sik,Iteration Theories. EATCS Monographs on Theoretical Computer Science. Springer Verlag (1993).","DOI":"10.1007\/978-3-642-78034-9"},{"key":"R8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(96)00248-4","volume":"179","author":"Bloom","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"R9","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/BFb0000461","volume":"1349","author":"Bloom","year":"1997","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R10","unstructured":"G. Boudol, Computational semantics of term rewriting systems, M. Nivat and J. Reynolds, Eds.,Algebraic Methods in Semantics. Cambridge University Press (1985) 170-235."},{"key":"R11","doi-asserted-by":"crossref","first-page":"468","DOI":"10.1007\/3-540-56610-4_83","volume":"668","author":"Corradini","year":"1993","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R12","unstructured":"A. Corradini and F. Drewes, (Cyclic) term graph rewriting is adequate for rational parallel term rewriting, Technical Report TR-97-14. Dipartimento di Informatica, Pisa (1997)."},{"key":"R13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BFb0026983","volume":"1290","author":"Corradini","year":"1997","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R14","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/BFb0053548","volume":"1378","author":"Corradini","year":"1998","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R15","unstructured":"A. Corradini and F. Gadducci, An algebraic presentation of term graphs,viags-monoidal categories.Applied Categorical Structures, to appear."},{"key":"R16","unstructured":"A. Corradini, U. Montanari, F. Rossi, H. Ehrig, R. Heckel and M. L\u00f6we, Algebraic approaches to graph transformation I: Basic concepts and double pushout approach, G. Rozenberg, Ed.,Handbook of Graph Grammars and Computing by Graph Transformation 1. World Scientific (1997)."},{"key":"R17","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0304-3975(93)90063-Y","volume":"109","author":"Corradini","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"R18","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0304-3975(87)90114-9","volume":"52","author":"Stefanescu","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"R19","unstructured":"Gh. Stefanescu, Algebra of flownomials. Technical Report SFB-Bericht 342\/16\/94 A. Technical University of M\u00fcnchen, Institut f\u00fcr Informatik (1994)."},{"key":"R20","first-page":"171","volume":"13","author":"Cazanescu","year":"1990","journal-title":"Fund. Inform."},{"key":"R21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(92)90171-B","volume":"99","author":"Cazanescu","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"R22","doi-asserted-by":"crossref","unstructured":"V.-E. Cazanescu and Gh. Stefanescu, Feedback, iteration and repetition, Gh. Paun, Ed.,Mathematical Aspects of Natural and Formal Languages. World Scientific (1995) 43-62.","DOI":"10.1142\/9789814447133_0003"},{"key":"R23","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0049-237X(08)71949-9","volume":"80","author":"Elgot","year":"1975","journal-title":"Stud. Logic Found. Math."},{"key":"R24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TSE.1976.233800","volume":"2","author":"Elgot","year":"1976","journal-title":"IEEE Trans. Software Engrg."},{"key":"R25","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0022-0000(78)90024-7","volume":"16","author":"Elgot","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"R26","first-page":"183","volume":"14","author":"\u00c9sik","year":"1980","journal-title":"Computational Linguistics and Computer Languages"},{"key":"R27","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/inco.1998.2746","volume":"148","author":"\u00c9sik","year":"1999","journal-title":"Inform. and Comput."},{"key":"R28","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0304-3975(97)00158-8","volume":"195","author":"\u00c9sik","year":"1998","journal-title":"Theoret. Comput. Sci."},{"key":"R29","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1145\/77606.77612","volume":"12","author":"Farmer","year":"1990","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"R30","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-53904-2_82","volume":"488","author":"Farmer","year":"1991","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R31","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(79)90032-1","volume":"18","author":"Ginali","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"R32","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"Goguen","year":"1977","journal-title":"J. ACM"},{"key":"R33","doi-asserted-by":"crossref","unstructured":"I. Guessarian,Algebraic Semantics. Springer Verlag,Lecture Notes in Comput. Sci.99(1981).","DOI":"10.1007\/3-540-10284-1"},{"key":"R34","unstructured":"M. Hasegawa,Models of Sharing Graphs. Ph.D. Thesis, University of Edinburgh, Department of Computer Science (1997)."},{"key":"R35","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1007\/3-540-62688-3_37","volume":"1210","author":"Hasegawa","year":"1997","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R36","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1051\/ita\/1991250504451","volume":"25","author":"Hoffmann","year":"1991","journal-title":"Theoret. Informatics Appl."},{"key":"R37","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1017\/S0305004100074338","volume":"119","author":"Joyal","year":"1996","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"R38","unstructured":"G. Kelly,Basic Concepts of Enriched Category Theory. Cambridge University Press (1982)."},{"key":"R39","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0063101","volume":"420","author":"Kelly","year":"1974","journal-title":"Lecture Notes in Math."},{"key":"R40","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0304-3975(87)90079-X","volume":"52","author":"Kennaway","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"R41","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1145\/177492.177577","volume":"16","author":"Kennaway","year":"1994","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"R42","first-page":"1","volume":"1","author":"Klop","year":"1992","journal-title":"Handb. Log. Comput. Sci."},{"key":"R43","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1142\/S0129054191000182","volume":"4","author":"Mart\u00ed-Oliet","year":"1991","journal-title":"Intrenat. J. Foundations Comput. Sci."},{"key":"R44","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"Meseguer","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"R45","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0890-5401(90)90013-8","volume":"88","author":"Meseguer","year":"1990","journal-title":"Inform. and Comput."},{"key":"R46","unstructured":"H. Miyoshi, Rewriting logic for cyclic sharing structures, T. Sato and A. Middeldorp, Eds.,Fuji International Symposium on Functional and Logic Programming. World Scientific (1998) 167-186."},{"key":"R47","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/BF01178907","volume":"32","author":"Montanari","year":"1995","journal-title":"Acta Inform."},{"key":"R48","unstructured":"M.J. Plasmeijer and M.C.J.D. van Eekelen,Functional Programming and Parallel Graph Rewriting. Addison Wesley (1993)."},{"key":"R49","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/BFb0018358","volume":"389","author":"Power","year":"1989","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R50","doi-asserted-by":"crossref","unstructured":"W. Reisig,Petri Nets: An Introduction. EACTS Monographs on Theoretical Computer Science. Springer Verlag (1985).","DOI":"10.1007\/978-3-642-69968-9"},{"key":"R51","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/3-540-18508-9_23","volume":"283","author":"Rydehard","year":"1987","journal-title":"Lecture Notes in Comput. Sci."},{"key":"R52","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0059703","volume":"182","author":"Scott","year":"1971","journal-title":"Lecture Notes in Math."},{"key":"R53","unstructured":"M.R. Sleep, M.J. Plasmeijer and M.C. van Eekelen,Term Graph Rewriting: Theory and Practice. Wiley (1993)."},{"key":"R54","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0304-3975(80)90013-4","volume":"10","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"R55","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(80)90051-1","volume":"10","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"R56","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0304-3975(80)90033-X","volume":"11","author":"Staples","year":"1980","journal-title":"Theoret. Comput. Sci."},{"key":"R57","doi-asserted-by":"crossref","unstructured":"R.H. Street, Categorical structures, M. Hazewinkel, Ed.,Handbook of Algebra. Elsevier (1996) 529-577.","DOI":"10.1016\/S1570-7954(96)80019-2"},{"key":"R58","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"Turner","year":"1979","journal-title":"Software: Practice and Experience"},{"key":"R59","unstructured":"M. Wand, A concrete approach to abstract recursive definitions, M. Nivat, Ed.,Automata, Languages and Programming. North Holland (1973) 331-341."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:1999128\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,26]],"date-time":"2020-03-26T23:00:33Z","timestamp":1585263633000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:1999128"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,7]]},"references-count":59,"journal-issue":{"issue":"4-5"},"alternative-id":["ita9935"],"URL":"https:\/\/doi.org\/10.1051\/ita:1999128","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,7]]}}}