{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:13:30Z","timestamp":1761610410100,"version":"build-2065373602"},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3954,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s1571-0661(05)80393-7","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:14:30Z","timestamp":1114679670000},"page":"575-588","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Local Distributed Model Checking of Reg CTL"],"prefix":"10.1016","volume":"68","author":[{"given":"Tom\u00e1\u0161","family":"Br\u00e1zdil","sequence":"first","affiliation":[]},{"given":"Ivana","family":"\u010cern\u00e1","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0661(05)80393-7_BIB1","series-title":"Proceedings of CAV'01, volume 2102 of Lecture Notes in Computer Science","first-page":"363","article-title":"The temporal logic Sugar.","author":"Beer","year":"2001"},{"key":"10.1016\/S1571-0661(05)80393-7_BIB2","series-title":"Proceedings of CAV'98, volume 1427 of Lecture Notes in Computer Science","first-page":"184","article-title":"On-the-fly model checking of RCTL formulas","author":"Beer","year":"1998"},{"key":"10.1016\/S1571-0661(05)80393-7_BIB3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01257083","article-title":"The temporal logic of branching time","volume":"20","author":"Ben-Ari, Z. Manna","year":"1983","journal-title":"Acta Informatica"},{"key":"10.1016\/S1571-0661(05)80393-7_BIB4","doi-asserted-by":"crossref","unstructured":"B. Bollig, M. Leucker, and M. Weber. Local parallel model checking for the alternation-free mu-calculus. In Proceedings of the 9th International SPIN Workshop on Model checking of Software (SPIN '02), volume 2318 of Lecture Notes in Computer Science, Springer-Verlag Inc., 2002.","DOI":"10.1007\/3-540-46017-9_11"},{"key":"10.1016\/S1571-0661(05)80393-7_BIB5","series-title":"Proceedings of CAV'90, volume 531 of Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/BFb0023739","article-title":"Branching time regular temporal logic for model checking with linear time complexity","author":"Hamaguchi","year":"1991"},{"issue":"1\u20143","key":"10.1016\/S1571-0661(05)80393-7_BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0168-0072(98)00039-6","article-title":"Dynamic linear time temporal logic","volume":"96","author":"Henriksen","year":"1999","journal-title":"Annals of Pure and Applied Logic"},{"key":"10.1016\/S1571-0661(05)80393-7_BIB7","series-title":"Proceedings of CONCUR'01, volume 2154 of Lecture Notes in Computer Science","first-page":"519","article-title":"Extended temporal logic revisited","author":"Kupferman","year":"2001"},{"issue":"2","key":"10.1016\/S1571-0661(05)80393-7_BIB8","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1145\/333979.333987","article-title":"An automata-theoretic approach to branching time model checking","volume":"47","author":"Kupferman","year":"2000","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1571-0661(05)80393-7_BIB9","first-page":"65","article-title":"Efficient on-the-fly model-checking for regular alternation-free mu-calculus","volume":"91","author":"Mateescu","year":"2000"},{"key":"10.1016\/S1571-0661(05)80393-7_BIB10","series-title":"Notes for Mathfit Workshop on finite model theory","article-title":"Games for bisimulation and model checking","author":"Stirling","year":"1996"},{"issue":"1","key":"10.1016\/S1571-0661(05)80393-7_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1994.1092","article-title":"Reasoning about infinite computations","volume":"115","author":"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:S1571066105803937?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066105803937?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:07:51Z","timestamp":1761610071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066105803937"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S1571066105803937"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(05)80393-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"type":"print","value":"1571-0661"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Local Distributed Model Checking of Reg CTL","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)80393-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier B.V.","name":"copyright","label":"Copyright"}]}}