{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T01:09:33Z","timestamp":1768266573723,"version":"3.49.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":4156,"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,3]]},"DOI":"10.1016\/s0304-3975(01)00165-7","type":"journal-article","created":{"date-parts":[[2002,10,15]],"date-time":"2002-10-15T09:27:27Z","timestamp":1034674047000},"page":"259-282","source":"Crossref","is-referenced-by-count":13,"title":["A causal semantics for CCS via rewriting logic"],"prefix":"10.1016","volume":"275","author":[{"given":"Pierpaolo","family":"Degano","sequence":"first","affiliation":[]},{"given":"Fabio","family":"Gadducci","sequence":"additional","affiliation":[]},{"given":"Corrado","family":"Priami","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00165-7_BIB1","first-page":"109","article-title":"Process algebra for synchronous communication","volume":"60","author":"Bergstra","year":"1984","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB2","series-title":"Algebraic Methods in Semantics","first-page":"170","article-title":"Computational semantics of term rewriting systems","author":"Boudol","year":"1985"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB3","article-title":"A non-interleaving semantics from CCS based on proved transitions","volume":"11","author":"Boudol","year":"1988","journal-title":"Fund. Inform."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB4","doi-asserted-by":"crossref","unstructured":"G. Carabetta, P. Degano, F. Gadducci, CCS semantics via proved transition systems and rewriting logic, in: C. Kirchner, H. Kirchner (Eds.), Rewriting Logic and its Applications, Electronic Notes in Theoretical Computer Science, Vol. 15, Elsevier, Amsterdam, 1999. Available at http:\/\/www.elsevier.nl\/locate\/entcs\/volume15.html\/.","DOI":"10.1016\/S1571-0661(05)80023-4"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB5","series-title":"Algebraic Methodology and Software Technology","first-page":"368","article-title":"CPO models for infinite term rewriting","volume":"Vol. 936","author":"Corradini","year":"1995"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB6","series-title":"Foundations of Software Science and Computation Structures","first-page":"156","article-title":"Rational term rewriting","volume":"Vol. 1378","author":"Corradini","year":"1998"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB7","series-title":"Rewriting Techniques and Applications","first-page":"225","article-title":"Relating two categorical models of term rewriting","volume":"Vol. 914","author":"Corradini","year":"1995"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB8","series-title":"Automata, Languages and Programming","first-page":"234","article-title":"Causal trees","volume":"Vol. 372","author":"Darondeau","year":"1989"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB9","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(90)90095-Y","article-title":"A partial ordering semantics for CCS","volume":"75","author":"Degano","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB10","unstructured":"P. Degano, F. Gadducci, C. Priami, Causality and replication in concurrent processes, submitted for publication. Available at http:\/\/www.di.unipi.it\/\u00a0\u0303gadducci\/papers."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB11","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1007\/s002360050064","article-title":"Axiomatizing the algebra of net computations and processes","volume":"33","author":"Degano","year":"1996","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB12","series-title":"Automata, Languages and Programming","first-page":"629","article-title":"Proved trees","volume":"Vol. 623","author":"Degano","year":"1992"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB13","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1145\/234528.234748","article-title":"Enhanced operational semantics","volume":"28","author":"Degano","year":"1996","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0304-3975(99)80003-6","article-title":"Non interleaving semantics for mobile processes","volume":"216","author":"Degano","year":"1999","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB15","unstructured":"F. Gadducci, On the algebraic approach to concurrent term rewriting, Ph.D. Thesis, Department of Computer Science, University of Pisa, 1996."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB16","doi-asserted-by":"crossref","unstructured":"F. Gadducci, U. Montanari, Tiles, rewriting rules and CCS, in: J. Meseguer (Ed.), Rewriting Logic and Applications, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1996. Available at http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html\/.","DOI":"10.1016\/S1571-0661(04)00030-1"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB17","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(92)90302-V","article-title":"Order sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations","volume":"105","author":"Goguen","year":"1992","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB18","series-title":"Communicating Sequential Processes","author":"Hoare","year":"1985"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB19","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/BF01178730","article-title":"Comparing causality and locality based equivalences","volume":"31","author":"Kiehn","year":"1994","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB20","series-title":"Algebraic and Logic Programming","first-page":"350","article-title":"Axiomatizing permutation equivalence in the \u03bb-calculus","volume":"Vol. 632","author":"Laneve","year":"1992"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB21","unstructured":"N. Mart\u0131\u0301-Oliet, J. Meseguer, Rewriting logic as a logical and semantic framework, in: J. Meseguer (Ed.), Rewriting Logic and Applications, Electronic Notes in Theoretical Computer Science, Vol. 4, Elsevier, Amsterdam, 1997. Available at http:\/\/www.elsevier.nl\/locate\/entcs\/volume4.html\/. An extended version is to appear in: D. Gabbay (Ed.), Handbook of Philosophical Logic, 2nd Edition, Vol. 6, Kluwer Academic Publishers, Dordrecht."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB22","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\/S0304-3975(01)00165-7_BIB23","series-title":"Concurrency Theory","first-page":"331","article-title":"Rewriting logic as a semantic framework for concurrency","volume":"Vol. 1119","author":"Meseguer","year":"1996"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB24","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB25","series-title":"Logic and Algebra of Specification","article-title":"The polyadic \u03c0-calculus: a tutorial","volume":"Vol. 94","author":"Milner","year":"1993"},{"key":"10.1016\/S0304-3975(01)00165-7_BIB26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(92)90008-4","article-title":"A calculus of mobile processes. Part I and II","volume":"100","author":"Milner","year":"1992","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(01)00165-7_BIB27","unstructured":"G. Plotkin, A structural approach to operational semantics, Tech. Report DAIMI FN-19, Computer Science Department, Aarhus University, 1981."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001657?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001657?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:56:11Z","timestamp":1578452171000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001657"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":27,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0304397501001657"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00165-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}