{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:09:11Z","timestamp":1761610151115,"version":"build-2065373602"},"reference-count":10,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"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":3893,"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":[[2002,12]]},"DOI":"10.1016\/s1571-0661(04)80409-2","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"145-159","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":9,"title":["Simple and Efficient Translation from LTL Formulas to B\u00fcchi Automata"],"prefix":"10.1016","volume":"66","author":[{"given":"Xavier","family":"Thirioux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S1571-0661(04)80409-2_NEWBIB1","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1016\/0890-5401(92)90017-A","article-title":"Symbolic model checking: 10e20 states and beyond","volume":"98","author":"Burch","year":"1992","journal-title":"Information and Computation"},{"key":"10.1016\/S1571-0661(04)80409-2_NEWBIB2","unstructured":"Amar Bouali. Xeve: an esterel verication environment (version vl.3). Technical Report RT-0214, INRIA Sophia-Antipolis, December 1997."},{"key":"10.1016\/S1571-0661(04)80409-2_NEWBIB3","doi-asserted-by":"crossref","unstructured":"Marco Daniele, Fausto Giunchiglia, and Moshe Y. Vardi. Improved automata generation for linear temporal logic. In International Conference on Computer Aided Verification, pages 249\u2013260, 1999.","DOI":"10.1007\/3-540-48683-6_23"},{"key":"10.1016\/S1571-0661(04)80409-2_NEWBIB4","unstructured":"Documentation and User's. The objective caml system release 3.02."},{"key":"10.1016\/S1571-0661(04)80409-2_NEWBIB5","doi-asserted-by":"crossref","unstructured":"Kousha Etessami and Gerard J. Holzmann. Optimizing buchi automata. In International Conference on Concurrency Theory, pages 153\u2013167, 2000.","DOI":"10.1007\/3-540-44618-4_13"},{"key":"10.1016\/S1571-0661(04)80409-2_NEWBIB6","doi-asserted-by":"crossref","unstructured":"Paul Gastin and Denis Oddoux. Fast ltl to bchi automata translation, 2001.","DOI":"10.1007\/3-540-44585-4_6"},{"key":"10.1016\/S1571-0661(04)80409-2_NEWBIB7","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"},{"issue":"5","key":"10.1016\/S1571-0661(04)80409-2_NEWBIB8","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1109\/32.588521","article-title":"The model checker SPIN","volume":"23","author":"Gerard Holzmann","year":"1997","journal-title":"Software Engineering"},{"key":"10.1016\/S1571-0661(04)80409-2_NEWBIB9","doi-asserted-by":"crossref","unstructured":"Fabio Somenzi and Roderick Bloem. Efficient bchi automata from ltl formulae. In International Conference on Computer Aided Verification, pages 53\u201365, 2000.","DOI":"10.1007\/10722167_21"},{"issue":"1","key":"10.1016\/S1571-0661(04)80409-2_NEWBIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1092","article-title":"Reasoning about infinite computations","volume":"115","author":"Moshe Vardi","year":"1994","journal-title":"Information and Computation"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804092?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104804092?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:04:32Z","timestamp":1761609872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104804092"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["S1571066104804092"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80409-2","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Simple and Efficient Translation from LTL Formulas to B\u00fcchi Automata","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(04)80409-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}