乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T15:31:42Z","timestamp":1720625502747},"reference-count":17,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4076,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1571-0661(04)00325-1","type":"journal-article","created":{"date-parts":[[2004,2,5]],"date-time":"2004-02-05T10:34:35Z","timestamp":1075977275000},"page":"157-176","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Comparing cospan-spans and tiles via a Hoare-style process calculus"],"prefix":"10.1016","volume":"62","author":[{"given":"Fabio","family":"Gadducci","sequence":"first","affiliation":[]},{"given":"Piergiulio","family":"Katis","sequence":"additional","affiliation":[]},{"given":"Ugo","family":"Montanari","sequence":"additional","affiliation":[]},{"given":"Nicoletta","family":"Sabadini","sequence":"additional","affiliation":[]},{"given":"Robert F.C.","family":"Walters","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB1","series-title":"Finite transition systems","author":"Arnold","year":"1994"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB2","series-title":"EATCS Monographs on Theoretical Computer Science","article-title":"Iteration Theories","author":"Bloom","year":"1993"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB3","doi-asserted-by":"crossref","unstructured":"R. Bruni, D. de Frutos-Escrig, N. Mart\u00ed-Oliet, and U. Montanari. Bisimilarity congruences for open terms and term graphs via tile logic. In C. Palamidessi, editor, Concurrency Theory, volume 1877 of Lect. Notes in Comp. Science, pages 259\u2013274. Springer, 2000.","DOI":"10.1007\/3-540-44618-4_20"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB4","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(01)00318-8","article-title":"Normal forms for algebras of connections","author":"Bruni","year":"2002","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB5","doi-asserted-by":"crossref","unstructured":"R. Bruni, J. Meseguer, and U. Montanari. Executable tile specifications for process calculi. In J. Finance-P., editor, Fundamental Approaches to Software Engineering, volume 1577 of Lect. Notes in Comp. Science, pages 60\u201376. Springer, 1999.","DOI":"10.1007\/978-3-540-49020-3_5"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB6","series-title":"Logic in Computer Science","first-page":"246","article-title":"Cartesian closed double categories, their lambda notation, and the pi-calculus","author":"Bruni","year":"1999"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB7","doi-asserted-by":"crossref","DOI":"10.1017\/S1471068401000035","article-title":"An interactive semantics of logic programming","author":"Bruni","year":"2001","journal-title":"Theory and Practice of Logic Programming"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB8","doi-asserted-by":"crossref","unstructured":"R. Bruni, U. Montanari, and V. Sassone. Open ended systems, dynamic bisimulation and tile logic. In J. van Leeuwen, O. Watanabe, M. Hagiya, P. D. Mosses, and T. Ito, editors, IFIP Theoretical Computer Science, volume 1872 of Lect. Notes in Comp. Science, pages 440\u2013456. Springer, 2000.","DOI":"10.1007\/3-540-44929-9_31"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB9","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1006\/inco.1999.2825","article-title":"Tile formats for located and mobile systems","volume":"156","author":"Ferrari","year":"2000","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB10","series-title":"Proof, Language and Interaction: Essays in Honour of Robin Milner","article-title":"The tile model","author":"Gadducci","year":"2000"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB11","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(01)00362-0","article-title":"Comparing logics for rewriting: Rewriting logic, action calculi and tile logic","author":"Gadducci","year":"2002","journal-title":"Theoret. Comput. Sci"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB12","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(04)00325-1_NEWBIB13","doi-asserted-by":"crossref","unstructured":"P. Katis, N. Sabadini, and R.F.C. Walters. SPAN(Graph): A categorical algebra of transition systems. In M. Johnson, editor, Algebraic Methodology and Software Technology, volume 1349 of Lect. Notes in Comp. Science, pages 307\u2013321. Springer, 1997.","DOI":"10.1007\/BFb0000479"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB14","doi-asserted-by":"crossref","unstructured":"P. Katis, N. Sabadini, and R.F.C. Walters. A formalization of the IWIM model. In A. Porto and G.-C. Roman, editors, Coordination, volume 1906 of Lect. Notes in Comp. Science, pages 267\u2013283. Springer, 2000.","DOI":"10.1007\/3-540-45263-X_17"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB15","series-title":"Fixed Points in Computer Science","article-title":"Recursion and concurrency","author":"Katis","year":"2001"},{"key":"10.1016\/S1571-0661(04)00325-1_NEWBIB16","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(04)00325-1_NEWBIB17","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:S1571066104003251?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104003251?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,11,4]],"date-time":"2021-11-04T22:33:30Z","timestamp":1636065210000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104003251"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":17,"alternative-id":["S1571066104003251"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)00325-1","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}