{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T11:26:36Z","timestamp":1775215596089,"version":"3.50.1"},"reference-count":25,"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)82534-4","type":"journal-article","created":{"date-parts":[[2005,5,19]],"date-time":"2005-05-19T09:46:30Z","timestamp":1116495990000},"page":"162-187","source":"Crossref","is-referenced-by-count":95,"special_numbering":"C","title":["The Maude LTL Model Checker"],"prefix":"10.1016","volume":"71","author":[{"given":"Steven","family":"Eker","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[]},{"given":"Ambarish","family":"Sridharanarayanan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)82534-4_BIB1","unstructured":"Spin \u2013 Formal Verification. 2002."},{"key":"10.1016\/S1571-0661(05)82534-4_BIB2","series-title":"Model Checking","author":"Clarke","year":"2001"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB3","article-title":"Maude: specification and programming in rewriting logic","author":"Clavel","year":"1999","journal-title":"SRI International"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB4","article-title":"Universal Algebra","author":"Cohn","year":"1965","journal-title":"Harper & Row"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0196-6774(82)90023-2","article-title":"An O(n log n) unidirectional algorithm for extrema finding in a circle","volume":"3","author":"Dolev","year":"1982","journal-title":"Journal of Algorithms"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB6","unstructured":"Eker S., Knapp M., Laderoute K. Lincoln, P. Talcott, C.L. Pathway logic: Executable models of biological networks. This volume."},{"key":"10.1016\/S1571-0661(05)82534-4_BIB7","first-page":"400","article-title":"Pathway logic: Symbolic analysis of biological signaling","author":"Eker","year":"2002","journal-title":"Proceedings of the Pacific Symposium on Biocomputing"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB8","series-title":"Eleventh International Conference on Concurrency Theory (CONCUR 2000), number 1877 in LNCS","first-page":"153","article-title":"Optimizing B\u00fcchi automata","author":"Etessami","year":"2000"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB9","series-title":"Thirteenth Conference on Computer Aided Verification (CAV \u203201), number 2102 in LNCS","first-page":"53","article-title":"Fast LTL to B\u00fcchi automata translation","author":"Gastin","year":"2001"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB10","unstructured":"Gerth R. Concise Promela Reference. 1997."},{"key":"10.1016\/S1571-0661(05)82534-4_BIB11","series-title":"Protocol Specification Testing and Verification","first-page":"3","article-title":"Simple on-the-fly automatic verification of linear temporal logic","author":"Gerth","year":"1995"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB12","series-title":"Proc. Second SPIN Workshop, August 1996, Vol. 32 of Dimacs Series in Discrete Mathematics and Theoretical Computer Science","first-page":"81","article-title":"On nested depth-first search","author":"Holzmann","year":"1997"},{"issue":"3","key":"10.1016\/S1571-0661(05)82534-4_BIB13","first-page":"289","article-title":"On nested depth first search","volume":"13","author":"Yannakakis","year":"1992","journal-title":"Design: An International Journal"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB14","doi-asserted-by":"crossref","unstructured":"Manna Z. Pnueli A. The Temporal Logic of Reactive Systems. 1992 Springer-Verlag","DOI":"10.1007\/978-1-4612-0931-7"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB15","series-title":"To appear in Handbook of Philosophical Logic","article-title":"Rewriting logic as a logical and semantic framework. Technical Report SRI-CSL-93-05, SRI International, Computer Science Laboratory","author":"Mart\u00ed-Oliet","year":"1993"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB16","first-page":"1","article-title":"Semantic models for distributed object reflection","author":"Meseguer","year":"2002","journal-title":"Proceedings of ECOOP\u203202, M\u00e1laga, Spain, June 2002"},{"issue":"1","key":"10.1016\/S1571-0661(05)82534-4_BIB17","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)82534-4_BIB18","series-title":"Proc. WADT\u203297","first-page":"18","article-title":"Membership algebra as a logical framework for equational specification","author":"Meseguer","year":"1998"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB19","series-title":"Computational Logic, NATO Advanced Study Institute, Marktoberdorf Germany, July 29 \u2013 August 6, 1997","first-page":"347","article-title":"Research directions in rewriting logic","author":"Meseguer","year":"1999"},{"issue":"6","key":"10.1016\/S1571-0661(05)82534-4_BIB20","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/BF01211473","article-title":"An algebraic verification of a mobile network","volume":"4","author":"Orava","year":"1992","journal-title":"Formal Aspects of Computing"},{"issue":"3","key":"10.1016\/S1571-0661(05)82534-4_BIB21","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0020-0190(81)90106-X","article-title":"Myths about the mutual exclusion problem","volume":"12","author":"Peterson","year":"1981","journal-title":"Information Processing Letters"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB22","series-title":"Abstract State Machines: Theory and Applications (ASM 2000), number 1912 in Lecture Notes in Computer Science","first-page":"287","article-title":"Symbolic analysis of transition systems","author":"Shankar","year":"2000"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB23","series-title":"Twelfth Conference on Computer Aided Verification (CAV \u203200), number 1633 in LNCS","first-page":"247","article-title":"Efficient B\u00fcchi automata from LTL formulae","author":"Somenzi","year":"2000"},{"key":"10.1016\/S1571-0661(05)82534-4_BIB24","unstructured":"M.-O. Stehr and C. L. Talcott. Plan in Maude\u2014specifying an active network programming language. This volume."},{"key":"10.1016\/S1571-0661(05)82534-4_BIB25","series-title":"PARLE\u203294, Proc. Sixth Int. Conf. on Parallel Architectures and Languages Europe, Athens, Greece, July 1994, volume 817 of LNCS","first-page":"648","article-title":"Rewriting: An effective model of concurrency","author":"Viry","year":"1994"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825344?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105825344?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:58:01Z","timestamp":1548482281000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105825344"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":25,"alternative-id":["S1571066105825344"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)82534-4","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}