{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T07:02:59Z","timestamp":1779087779762,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662439500","type":"print"},{"value":"9783662439517","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_8","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"86-97","source":"Crossref","is-referenced-by-count":6,"title":["On the Complexity of Temporal-Logic Path Checking"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Bundala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00ebl","family":"Ouaknine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Artho, C., Barringer, H., Goldberg, A., Havelund, K., Khurshid, S., Lowry, M., Pasareanu, C., Rosu, G., Sen, K., Visser, W., Washington, R.: Combining test case generation and runtime verification. Theoretical Computer Science\u00a0336(2-3) (2005)","DOI":"10.1016\/j.tcs.2004.11.007"},{"key":"8_CR2","unstructured":"Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: On monotone planar circuits. In: Proceedings of Fourteenth Annual IEEE Conference on Computational Complexity (1999)"},{"key":"8_CR3","unstructured":"Bundala, D., Ouaknine, J.: On the complexity of path checking of temporal logics (full version). CoRR, abs\/1312.7603"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/11944836_8","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"T. Chakraborty","year":"2006","unstructured":"Chakraborty, T., Datta, S.: One-input-face MPCVP is hard for L, but in LogDCFL. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol.\u00a04337, pp. 57\u201368. Springer, Heidelberg (2006)"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1006\/inco.2001.3094","volume":"174","author":"S. Demri","year":"2002","unstructured":"Demri, S., Schnoebelen, P.: The complexity of propositional linear temporal logics in simple cases. Information and Computation\u00a0174(1), 84\u2013103 (2002)","journal-title":"Information and Computation"},{"issue":"2","key":"8_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1023\/B:FORM.0000017718.28096.48","volume":"24","author":"B. Finkbeiner","year":"2004","unstructured":"Finkbeiner, B., Sipma, H.: Checking finite traces using alternating automata. Formal Methods in System Design\u00a024(2), 101\u2013127 (2004)","journal-title":"Formal Methods in System Design"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Goldschlager, L.M.: The monotone and planar circuit value problems are log space complete for P. SIGACT News\u00a09 (July 1977)","DOI":"10.1145\/1008354.1008356"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Ramachandran, V.: Parallel algorithms for shared-memory machines. In: Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) (1990)","DOI":"10.1016\/B978-0-444-88071-0.50022-9"},{"key":"8_CR9","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-02930-1_20","volume-title":"Automata, Languages and Programming","author":"L. Kuhtz","year":"2009","unstructured":"Kuhtz, L., Finkbeiner, B.: LTL path checking is efficiently parallelizable. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol.\u00a05556, pp. 235\u2013246. Springer, Heidelberg (2009)"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Kuhtz, L., Finkbeiner, B.: Efficient parallel path checking for linear-time temporal logic with past and bounds. Logical Methods in Computer Science\u00a08(4) (2012)","DOI":"10.2168\/LMCS-8(4:10)2012"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1007\/11672142_54","volume-title":"STACS 2006","author":"N. Limaye","year":"2006","unstructured":"Limaye, N., Mahajan, M., Sarma, J.M.N.: Evaluating monotone circuits on cylinders, planes and tori. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884, pp. 660\u2013671. Springer, Heidelberg (2006)"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-30206-3_12","volume-title":"Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems","author":"O. Maler","year":"2004","unstructured":"Maler, O., Nickovic, D.: Monitoring temporal properties of continuous signals. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol.\u00a03253, pp. 152\u2013166. Springer, Heidelberg (2004)"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-540-45187-7_17","volume-title":"CONCUR 2003 - Concurrency Theory","author":"N. Markey","year":"2003","unstructured":"Markey, N., Schnoebelen, P.: Model checking a path (Preliminary report). In: Amadio, R.M., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol.\u00a02761, pp. 251\u2013265. Springer, Heidelberg (2003)"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-45657-0_17","volume-title":"Computer Aided Verification","author":"H.L.S. Younes","year":"2002","unstructured":"Younes, H.L.S., Simmons, R.G.: Probabilistic verification of discrete event systems using acceptance sampling. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, pp. 223\u2013235. Springer, Heidelberg (2002)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T02:56:11Z","timestamp":1558925771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}