{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:48:17Z","timestamp":1764557297781,"version":"3.41.2"},"reference-count":1,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","license":[{"start":{"date-parts":[[2012,10,23]],"date-time":"2012-10-23T00:00:00Z","timestamp":1350950400000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/arxiv.org\/licenses\/nonexclusive-distrib\/1.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>Path checking, the special case of the model checking problem where the model\nunder consideration is a single path, plays an important role in monitoring,\ntesting, and verification. We prove that for linear-time temporal logic (LTL),\npath checking can be efficiently parallelized. In addition to the core logic,\nwe consider the extensions of LTL with bounded-future (BLTL) and past-time\n(LTL+Past) operators. Even though both extensions improve the succinctness of\nthe logic exponentially, path checking remains efficiently parallelizable: Our\nalgorithm for LTL, LTL+Past, and BLTL+Past is in AC^1(logDCFL) \\subseteq NC.<\/jats:p>","DOI":"10.2168\/lmcs-8(4:10)2012","type":"journal-article","created":{"date-parts":[[2013,11,29]],"date-time":"2013-11-29T13:21:33Z","timestamp":1385731293000},"source":"Crossref","is-referenced-by-count":7,"title":["Efficient Parallel Path Checking for Linear-Time Temporal Logic With Past and Bounds"],"prefix":"10.46298","volume":"Volume 8, Issue 4","author":[{"given":"Lars","family":"Kuhtz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernd","family":"Finkbeiner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2012,10,23]]},"reference":[{"key":"450:not-found"}],"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/1219\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/1219\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T20:06:03Z","timestamp":1681243563000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/1219"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,23]]},"references-count":1,"URL":"https:\/\/doi.org\/10.2168\/lmcs-8(4:10)2012","relation":{"is-same-as":[{"id-type":"arxiv","id":"1210.0574","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.1210.0574","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"type":"electronic","value":"1860-5974"}],"subject":[],"published":{"date-parts":[[2012,10,23]]},"article-number":"1219"}}