{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:47:12Z","timestamp":1762458432187},"reference-count":20,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"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":3406,"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":[[2004,4]]},"DOI":"10.1016\/s1571-0661(05)82540-x","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"282-300","source":"Crossref","is-referenced-by-count":19,"special_numbering":"C","title":["Implementing CCS in Maude 2"],"prefix":"10.1016","volume":"71","author":[{"given":"Alberto","family":"Verdejo","sequence":"first","affiliation":[]},{"given":"Narciso","family":"Mart\u00ed-Oliet","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82540-X_BIB1","unstructured":"C. Braga. Rewriting Logic as a Semantic Framework for Modular Structural Operational Semantics. PhD thesis, Departamento de Inform\u00e1tica, Pontif\u00efcia Universidade Cat\u00f3lica do Rio de Janeiro, Brazil, Sept. 2001."},{"key":"10.1016\/S1571-0661(05)82540-X_BIB2","unstructured":"R. Bruni. Tile Logic for Synchronized Rewriting of Concurrent Systems. PhD thesis, Dipartimento di Informatica, Universit\u00e0 di Pisa, 1999. Technical Report TD-1\/99. http:\/\/www.di.unipi.it\/phd\/tesi\/tesi_1999\/TD-1-99.ps.gz."},{"key":"10.1016\/S1571-0661(05)82540-X_BIB3","series-title":"Proceedings of FORTE 2001, 21st International Conference on Formal Techniques for Networked and Distributed Systems","first-page":"184","article-title":"A symbolic semantics and bisimulation for Full LOTOS","author":"Calder","year":"2001"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB4","series-title":"Proceedings Second International Workshop on Rewriting Logic and its Applications, WRLA\u203298, Pont-\u00e0-Mousson, France, September 1-4, 1998, volume 15 of Electronic Notes in Theoretical Computer Science","first-page":"253","article-title":"CCS semantics via proved transition systems and rewriting logic","author":"Carabetta","year":"1998"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB5","unstructured":"M. Clavel. Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications. CSLI Publications, 2000."},{"key":"10.1016\/S1571-0661(05)82540-X_BIB6","series-title":"Manual distributed as documentation of the Maude system","article-title":"Maude: Specification and programming in rewriting logic","author":"Clavel","year":"1999"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB7","series-title":"Proceedings Third International Workshop on Rewriting Logic and its Applications, WRLA 2000, Kanazawa, Japan, September 18-20, 2000, volume 36 of Electronic Notes in Theoretical Computer Science","first-page":"297","article-title":"Towards Maude 2.0","author":"Clavel","year":"2000"},{"issue":"1-2","key":"10.1016\/S1571-0661(05)82540-X_BIB8","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0304-3975(01)00165-7","article-title":"A causal semantics for CCS via rewriting logic","volume":"275","author":"Degano","year":"2002","journal-title":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB9","series-title":"The semantics of programming languages: an elementary introduction using structural operational semantics","author":"Hennessy","year":"1990"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB10","series-title":"Handbook of Philosophical Logic, Second Edition, Volume 9","article-title":"Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory, Aug. 1993. To appear","author":"Mart\u00ed-Oliet","year":"2002"},{"issue":"1","key":"10.1016\/S1571-0661(05)82540-X_BIB11","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":"Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB12","series-title":"Communication and Concurrency","author":"Milner","year":"1989"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB13","series-title":"Mathematical Foundations of Computer Science 1999, 24th International Symposium, MFCS\u203299 Szklarska Poreba, Poland, September 6-10, 1999, Proceedings, volume 1672 of Lecture Notes in Computer Science","first-page":"70","article-title":"Foundations of modular SOS","author":"Mosses","year":"1999"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB14","series-title":"Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science.","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0030541","author":"Paulson","year":"1994"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB15","unstructured":"M.-O. Stehr and J. Meseguer. Pure type systems in rewriting logic. In Proc. of LFM\u203299: Workshop on Logical Frameworks and Meta-Languages, Paris, France, Sept. 1999."},{"key":"10.1016\/S1571-0661(05)82540-X_BIB16","series-title":"Logics for Concurrency: Structure vs Automata, volume 1043 of Lecture Notes in Computer Science","first-page":"149","article-title":"Modal and temporal logics for processes","author":"Stirling","year":"1996"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB17","series-title":"Proceedings Fourth International Workshop on Rewriting Logic and its Applications, WRLA 2002, Pisa, Italy, September 19-21, 2002, volume 71 of Electronic Notes in Theoretical Computer Science","first-page":"217","article-title":"An executable specification of asynchronous pi-calculus semantics and may testing in Maude 2.0","author":"Thati","year":"2002"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB18","series-title":"Proceedings FORTE 2002, Lecture Notes in Computer Science","article-title":"Building tools for LOTOS symbolic semantics in Maude","author":"Verdejo","year":"2002"},{"key":"10.1016\/S1571-0661(05)82540-X_BIB19","unstructured":"A. Verdejo and N. Mart\u00ed-Oliet. Executing and verifying CCS in Maude. Technical Report 99-00, Dpto. Sistemas Inform\u00e1ticos y Programaci\u00f3n, Universidad Complutense de Madrid, Feb. 2000."},{"key":"10.1016\/S1571-0661(05)82540-X_BIB20","series-title":"Formal Methods For Distributed System Development. FORTE\/PSTV 2000","first-page":"351","article-title":"Implementing CCS in Maude","author":"Verdejo","year":"2000"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610582540X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S157106610582540X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T05:57:58Z","timestamp":1548482278000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S157106610582540X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":20,"alternative-id":["S157106610582540X"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82540-x","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}