{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T08:49:53Z","timestamp":1656233393136},"reference-count":38,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4429,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,6]]},"DOI":"10.1016\/s0304-3975(00)00121-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"27-55","source":"Crossref","is-referenced-by-count":11,"title":["A Coalgebraic presentation of structured transition systems"],"prefix":"10.1016","volume":"260","author":[{"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[]},{"given":"Martin","family":"Gro\u00dfe-Rhode","sequence":"additional","affiliation":[]},{"given":"Reiko","family":"Heckel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00121-3_BIB1","series-title":"Non-Well-Founded Sets","volume":"vol. 14","author":"Aczel","year":"1988"},{"issue":"1","key":"10.1016\/S0304-3975(00)00121-3_BIB2","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1145\/200836.200876","article-title":"Bisimulation can't be traced","volume":"42","author":"Bloom","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB3","first-page":"47","article-title":"A 2-categorical approach to change of base and geometric morphisms I","volume":"32","author":"Carboni","year":"1991","journal-title":"Cahiers Topologie Geom. Differentielle Categoriques"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB4","doi-asserted-by":"crossref","unstructured":"A. Corradini, A. Asperti, A categorical model for logic programs: indexed monoidal categories, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), [9], 1993.","DOI":"10.1007\/3-540-56596-5_31"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB5","doi-asserted-by":"crossref","unstructured":"A. Corradini, F. Gadducci, A 2-categorical presentation of term graph rewriting, in: E. Moggi, G. Rosolini (Eds.), Category Theory and Computer Science (CTCS\u201997), Lecture Notes in Computer Science, Vol. 1290, Springer, Berlin, 1997","DOI":"10.1007\/BFb0026983"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB6","series-title":"Proc. 13th Workshop on Algebraic Development Techniques, (WADT\u201998)","article-title":"An algebra of graph derivations using finite (co-) limit double theories","volume":"vol. 1589","author":"Corradini","year":"1999"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB7","doi-asserted-by":"crossref","unstructured":"A. Corradini, R. Heckel, U. Montanari, From SOS specifications to structured coalgebras: how to make bisimulation a congruence, in: B. Jacobs, J. Rutten (Eds.), 2nd Workshop on Coalgebraic Methods in Computer Science (CMCS\u201999), Amsterdam, The Netherlands, Electronic Notes of Theoretical Computer Science, vol. 19, Elsevier, Amsterdam, 1999, http:\/\/www.elsevier.nl\/locate\/entcs.","DOI":"10.1016\/S1571-0661(05)80273-7"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB8","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\/S0304-3975(00)00121-3_BIB9","series-title":"Proc. REX Workshop on Semantics: Foundations and Applications, Beekbergen, The Netherlands, 1992","volume":"vol. 666","author":"de Bakker","year":"1993"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB10","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","article-title":"Higher level synchronizing devices in MEIJE-SCCS","volume":"37","author":"De Simone","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB11","series-title":"Recent Trends in Algebraic Development Techniques","first-page":"223","article-title":"An inductive view of graph transformation","volume":"vol. 1376","author":"Gadducci","year":"1998"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB12","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1016\/0890-5401(92)90013-6","article-title":"Structured operational semantics and bisimulation as a congruence","volume":"100","author":"Groote","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB13","unstructured":"R. Heckel, Open graph transformation systems: a new approach to the compositional modelling of concurrent and reactive systems, Ph.D. Thesis, TU Berlin, 1998."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB14","doi-asserted-by":"crossref","unstructured":"B. Jacobs, L. Moss, H. Reichel, J. Rutten (Eds.), 1st Workshop on Coalgebraic Methods in Computer Science (CMCS\u201998), Lisbon, Portugal, Electronic Notes of Theoretical Computer Science, vol. 11, Elsevier, Amsterdam, 1998, http:\/\/www. elsevier.nl\/locate\/entcs.","DOI":"10.1016\/S1571-0661(05)80564-X"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB15","doi-asserted-by":"crossref","unstructured":"B. Jacobs, J. Rutten (Eds.), 2nd Workshop on Coalgebraic Methods in Computer Science (CMCS\u201999), Amsterdam, The Netherlands, Electronic Notes of Theoretical Computer Science, vol. 19, Elsevier, Amsterdam, 1999, http:\/\/www.elsevier.nl\/locate\/entcs.","DOI":"10.1016\/S1571-0661(05)80264-6"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB16","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1112\/blms\/7.3.294","article-title":"Adjont lifting theorems for categories of algebras","volume":"7","author":"Johnstone","year":"1975","journal-title":"Bull. London Math. soc."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB17","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1006\/inco.1996.0057","article-title":"Bisimulation from open maps","volume":"127","author":"Joyal","year":"1996","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB18","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/360248.360251","article-title":"Formal verifications of parallel programs","volume":"7","author":"Keller","year":"1976","journal-title":"comm. ACM"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB19","doi-asserted-by":"crossref","unstructured":"S. Lasota, Coalgebra morphisms subsume open maps, in: B. Jacobs, J. Rutten (Eds.), 2nd Workshop on coalgebraic Methods in Computer Science (CMCS\u201999), Amsterdam, The Netherlands, Electronic Notes of Theoretical Computer Science, vol. 19, Elsevier, Amsterdam, 1999, http:\/\/www.elsevier.nl\/locate\/entcs.","DOI":"10.1016\/S1571-0661(05)80266-X"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB20","series-title":"Categories for the Working Mathematician","volume":"vol. 5","author":"Mac Lane","year":"1971"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB21","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0304-3975(99)00303-5","article-title":"Towards a unified view of bisimulation: a comparative study","volume":"238","author":"Majster-Cederbaum","year":"2000","journal-title":"Theoret. comput. Sci."},{"issue":"2","key":"10.1016\/S0304-3975(00)00121-3_BIB22","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":"Inform. comput."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB23","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB24","first-page":"171","article-title":"Dynamic congruence vs. progressing bisimulation for CCS","volume":"16","author":"Montanari","year":"1992","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB25","unstructured":"G. Plotkin, A structural approach to operational semantics, Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB26","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1017\/S096012950000147X","article-title":"Processes as terms: non-well-founded models for bisimulation","volume":"2","author":"Rutten","year":"1992","journal-title":"Math. Struct. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB27","first-page":"3","article-title":"Universal coalgebra: a theory of systems","volume":"249","author":"Rutten","year":"2000","journal-title":"Technical Report CS-R9652, CWI, 1996, Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB28","series-title":"Automata and coinduction (an exercise in coalgebra), Proc. 9th Internat. Conf. on Concurrency Theory, Concur\u201998, Nice, France","volume":"vol. 1466","author":"Rutten","year":"1998"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB29","doi-asserted-by":"crossref","unstructured":"J.J.M.M. Rutten, Relators and metric bisimulations, in: B. Jacobs, L. Moss, H. Reichel, J. Rutten (Eds.), 1st Workshop on Coalgebraic Methods in Computer Science (CMCS\u201998), Lisbon, Portugal, Electronic Notes of Theoretical Computer Science, vol. 11, Elsevier, Amsterdam, 1998, http:\/\/www. elsevier.nl\/locate\/entcs.","DOI":"10.1016\/S1571-0661(04)00063-5"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB30","doi-asserted-by":"crossref","unstructured":"J.J.M.M. Rutten, D. Turi, On the foundations of final semantics: non-standard sets, metric spaces, partial orders, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), [9] 1993.","DOI":"10.1007\/3-540-56596-5_45"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB31","series-title":"Proc. REX School\/Symp. on a Decade of Concurrency, Noordwijkerhout, The Netherlands, 1993","article-title":"Initial algebra and final co-algebra semantics for concurrency","volume":"vol. 803","author":"Rutten","year":"1994"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB32","unstructured":"A.M. Thijs, Simulation and fixpoint semantics, Ph.D. Thesis, Rijkhsuniversiteit Groningen, 1996."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB33","unstructured":"D. Turi, Functorial operational semantics and its denotational dual, Ph.D. Thesis, Free University, Amsterdam, 1996."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB34","unstructured":"D. Turi, B. Jacobs, On final semantics for applicative and non-deterministic languages, Proc. 5th Biennial Meeting on Category Theory in Computer Science, 1993."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB35","doi-asserted-by":"crossref","unstructured":"D. Turi, G. Plotkin, Towards a mathematical operational semantics, Proc. LICS\u201997, 1997, pp. 280\u2013305.","DOI":"10.1109\/LICS.1997.614955"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB36","series-title":"Handbook of Philosophical Logic, vol. II","first-page":"167","article-title":"Correspondence theory","author":"van Benthem","year":"1984"},{"key":"10.1016\/S0304-3975(00)00121-3_BIB37","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0890-5401(90)90058-P","article-title":"A Compositional proof system on a category of labelled transition systems","volume":"87","author":"Winskel","year":"1990","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(00)00121-3_BIB38","series-title":"Handbook of Logic in Computer Science","first-page":"1","article-title":"Models for concurrency","volume":"vol. 4","author":"Winskel","year":"1995"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001213?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001213?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:19Z","timestamp":1578458899000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001213"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":38,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["S0304397500001213"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00121-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,6]]}}}