{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:46Z","timestamp":1761610426424,"version":"build-2065373602"},"reference-count":25,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4958,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2000]]},"DOI":"10.1016\/s1571-0661(05)80145-8","type":"journal-article","created":{"date-parts":[[2005,5,25]],"date-time":"2005-05-25T08:37:08Z","timestamp":1117010228000},"page":"175-193","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Modal Logic for Rewriting Theories"],"prefix":"10.1016","volume":"36","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S1571-0661(05)80145-8_BIB1","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1093\/jigpal\/3.5.685","article-title":"Back and forth between modal and classical logic","volume":"3","author":"Andreka","year":"1995","journal-title":"J. of the IGPL"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB2","series-title":"volume 35 of Oxford Logic Guides.","article-title":"Modal Logic","author":"Chagrov","year":"1997"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB3","unstructured":"M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and J. Quesada. A maude tutorial. Draft, March 2000. Available at http:\/\/maude.csl.sri.com\/papers\/."},{"key":"10.1016\/S1571-0661(05)80145-8_BIB4","series-title":"Proc. 1st Intl. Workshop on Rewriting Logic and its Applications","article-title":"Principles of maude","author":"Clavel","year":"1996"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB5","series-title":"Proc. 2nd Intl. Workshop on Rewriting Logic and its Applications","article-title":"From rewrite theories to temporal logic theories","author":"Denker","year":"1998"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB6","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)00041-6","article-title":"Foundations of behavioural specification in rewriting logic","volume":"4","author":"Diaconescu","year":"1996","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB7","series-title":"Recent Trends in Algebraic Development Techniques, WADT'99, France, Selected Papers, volume 1827 of Lecture Notes in Computer Science.","article-title":"Towards a verification logic for rewriting logic","author":"Fiadeiro","year":"1999"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB8","article-title":"A hidden agenda","author":"Goguen","year":"1997","journal-title":"Technical Report CS97-538, UCSD"},{"issue":"1","key":"10.1016\/S1571-0661(05)80145-8_BIB9","doi-asserted-by":"crossref","DOI":"10.1145\/147508.147524","article-title":"Institutions: Abstract model theory for specification and programming","volume":"39","author":"Goguen","year":"1992","journal-title":"Journal of the Association for Computing Machinery"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB10","series-title":"volume 7 of CSLI Lecture Notes. Center for the Study of Language and Information","article-title":"Logics of Time and Computation","author":"Goldblatt","year":"1992"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB11","series-title":"Proc. AMAST '98, 7th International Conference on Algebraic Methodology and Software Technology, number 1548 in Lecture Notes in Computer Science","article-title":"Observational logic","author":"Hennicker","year":"1999"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB12","article-title":"A tutorial on (co)algebras and (co)induction","volume":"62","author":"Jacobs","year":"1997","journal-title":"EATCS Bulletin"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB13","series-title":"Handbook of Mathematical Logic","article-title":"Fundamentals of model theory","author":"Keisler","year":"1977"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB14","series-title":"Coalgebraic Methods in Computer Science (CMCS'98), volume 11 of Electronic Notes in Theoretical Computer Science","first-page":"57","article-title":"Specifying coalgebras with modal logic","author":"Kurz","year":"1998"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/S1571-0661(04)00048-9","article-title":"Object-oriented specifications of distributed systems in the \u03bc-calculus and maude","volume":"4","author":"Lechner","year":"1996","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB16","unstructured":"U. Lechner. Object-Oriented Specification of Distributed Systems. PhD thesis, University of Passau, 1997."},{"key":"10.1016\/S1571-0661(05)80145-8_BIB17","series-title":"Object Orientation with Parallelism and Persistence","article-title":"Modal \u03bc-maude","author":"Lengauer","year":"1996"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB18","series-title":"Handbook of Mathematical Logic","article-title":"Admissible sets and infinitary logic","author":"Makkai","year":"1977"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB19","series-title":"Proc. 1st Intl. Workshop on Rewriting Logic and its Applications","article-title":"Rewriting logic as a logical and semantic framework","author":"Mart\u00ed-Oliet","year":"1996"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB20","series-title":"Computational Logic, NATO Advanced Study Institute","article-title":"Research directions in rewriting logic","author":"Meseguer","year":"1998"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB21","series-title":"Model-Theoretic Logics, Perspectives in Mathematical Logic","article-title":"\u03c91\u03c9 and admissible fragments","author":"Nadel","year":"1985"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB22","series-title":"Coalgebraic Methods in Computer Science (CMCS'00), volume 33 of Electronic Notes in Theoretical Computer Science","article-title":"Coalgebras and modal logic","author":"R\u00f6b\u0303ger","year":"2000"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB23","unstructured":"Jan Rutten. Universal coalgebra: A theory of systems. Theoretical Computer Science. To appear."},{"key":"10.1016\/S1571-0661(05)80145-8_BIB24","doi-asserted-by":"crossref","unstructured":"Colin Stirling. Modal and temporal logics. In S. Abramsky, D. Gabbay, and T. S. E. Maibaum, editors, Handbook of Logic in Computer Science, volume 2. Oxford Science Publications, 1992.","DOI":"10.1093\/oso\/9780198537618.003.0005"},{"key":"10.1016\/S1571-0661(05)80145-8_BIB25","series-title":"Handbook of Theoretical Computer Science","article-title":"Algebraic specification","author":"Wirsing","year":"1990"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801458?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105801458?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:13Z","timestamp":1761610153000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105801458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"references-count":25,"alternative-id":["S1571066105801458"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80145-8","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Modal Logic for Rewriting Theories","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(05)80145-8","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2000 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}