乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:18:32Z","timestamp":1733548712422,"version":"3.30.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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":4095,"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":[[2002,5]]},"DOI":"10.1016\/s0304-3975(01)00025-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:07:16Z","timestamp":1027652836000},"page":"163-192","source":"Crossref","is-referenced-by-count":22,"title":["Compositional SOS and beyond: a coalgebraic view of open systems"],"prefix":"10.1016","volume":"280","author":[{"given":"Andrea","family":"Corradini","sequence":"first","affiliation":[]},{"given":"Reiko","family":"Heckel","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0304-3975(01)00025-1_BIB1","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90185-I","article-title":"The chemical abstract machine","volume":"96","author":"Berry","year":"1992","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(01)00025-1_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(01)00025-1_BIB3","series-title":"Proc. REX Workshop \u2018Semantics: Foundations and Applications\u2019, Beekbergen, The Netherlands, 1992","article-title":"A categorical model for logic programs: indexed monoidal categories","volume":"Vol. 666","author":"Corradini","year":"1993"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB4","article-title":"A 2-categorical presentation of term graph rewriting","volume":"Vol. 1290","author":"Corradini","year":"1997"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB5","doi-asserted-by":"crossref","unstructured":"A. Corradini, M. Gro\u00dfe-Rhode, R. Heckel, Structured transition systems as lax coalgebras, in: B. Jacobs, L. Moss, H. Reichel, J. Rutten (Eds.), Proc. 1st Workshop on Coalgebraic Methods in Computer Science, CMCS\u201998, Lisbon, Portugal, Electronic Notes in Theoretical Computer Science, Vol. 11, Elsevier Science, Amsterdam, 1998. http:\/\/www.elsevier.nl\/locate\/entcs.","DOI":"10.1016\/S1571-0661(04)00051-9"},{"key":"10.1016\/S0304-3975(01)00025-1_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(01)00025-1_BIB7","series-title":"From SOS specifications to structured coalgebras: How to make bisimulation a congruence, in Proc. 2nd Workshop on Coalgebraic Methods in Computer Science, CMCS\u201999","volume":"Vol. 19","author":"Corradini","year":"1999"},{"key":"10.1016\/S0304-3975(01)00025-1_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(01)00025-1_BIB9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0304-3975(85)90093-3","article-title":"Higher level synchronizing devices in MEIJE\u2013SCCS","volume":"37","author":"De Simone","year":"1985","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB10","series-title":"Fundamentals of algebraic specifications 1: equations and initial semantics","volume":"Vol. 6","author":"Ehrig","year":"1985"},{"issue":"1","key":"10.1016\/S0304-3975(01)00025-1_BIB11","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0304-3975(96)00063-1","article-title":"A \u03c0-calculus with explicit substitutions","volume":"168","author":"Ferrari","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB12","first-page":"268","article-title":"Correctness of recursive parallel nondeterministic flow programs","volume":"27","author":"Goguen","year":"1983","journal-title":"JCSS"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB13","doi-asserted-by":"crossref","unstructured":"F. Gadducci, U. Montanari, The tile model, in: G. Plotkin, C. Stirling, M. Tofte (Eds.), Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT press, Cambridge, MA, 2000, to appear. Paper available from http:\/\/www.di.unipi.it\/\u00a0\u0303ugo\/festschrift.ps.","DOI":"10.7551\/mitpress\/5641.003.0010"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB14","unstructured":"J. Goguen, G. Malcolm, A hidden agenda, Tech. Report CS97-538, University of California at San Diego, 1997."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB15","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1090\/conm\/092\/1003198","article-title":"The category of sketches as a model for algebraic semantics","volume":"92","author":"Gray","year":"1989","journal-title":"Contemp. Math."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB16","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. and Comput."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB17","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(01)00025-1_BIB18","doi-asserted-by":"crossref","unstructured":"A. Joyal, M. Nielsen, G. Winskel, Bisimulation from open maps, Proc. LICS\u201993, Full version as BRICS RS-94-7, Department of Computer Science, University of Aarhus, 1994.","DOI":"10.7146\/brics.v1i7.21663"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB19","article-title":"Etude g\u00e9n\u00e9rale de la cat\u00e9gorie des esquisses","volume":"24","author":"Lair","year":"1974","journal-title":"Esquisses Math."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB20","series-title":"Recent Trends in Algebraic Development Techniques","first-page":"18","article-title":"Membership algebra as logical framework for equational specification","volume":"Vol. 1376","author":"Meseguer","year":"1998"},{"issue":"2","key":"10.1016\/S0304-3975(01)00025-1_BIB21","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. and Comput."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB22","series-title":"Recent Trends in Algebraic Development Techniques","first-page":"62","article-title":"Mapping tile logic into rewriting logic","volume":"Vol. 1376","author":"Meseguer","year":"1998"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB23","series-title":"A Calculus for Communicating Systems","volume":"Vol. 92","author":"Milner","year":"1980"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB25","series-title":"An introduction to history dependent automata, Proc. 2nd Workshop on Higher-Order Operational Techniques in Semantics (HOOTS II)","volume":"Vol. 10","author":"Montanari","year":"1998"},{"key":"10.1016\/S0304-3975(01)00025-1_BIB26","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(01)00025-1_BIB27","unstructured":"G. Plotkin, A structural approach to operational semantics, Tech. Report DAIMI FN-19, Aarhus University, Computer Science Department, 1981."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB28","unstructured":"J.J.M.M. Rutten, Universal coalgebra: a theory of systems, Tech. Report CS-R9652, CWI, 1996, Theoret. Comput. Sci., to appear."},{"key":"10.1016\/S0304-3975(01)00025-1_BIB29","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"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501000251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T19:20:28Z","timestamp":1733512828000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501000251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0304397501000251"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00025-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}