{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T02:20:32Z","timestamp":1785291632687,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642029295","type":"print"},{"value":"9783642029301","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_20","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"235-246","source":"Crossref","is-referenced-by-count":17,"title":["LTL Path Checking Is Efficiently Parallelizable"],"prefix":"10.1007","author":[{"given":"Lars","family":"Kuhtz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernd","family":"Finkbeiner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/11940197_11","volume-title":"Formal Approaches to Software Testing and Runtime Verification","author":"R. Armoni","year":"2006","unstructured":"Armoni, R., Korchemny, D., Tiemeyer, A., Vardi, M.Y., Zbar, Y.: Deterministic Dynamic Monitors for Linear-Time Assertions. In: Havelund, K., N\u00fa\u00f1ez, M., Ro\u015fu, G., Wolff, B. (eds.) FATES 2006 and RV 2006. LNCS, vol.\u00a04262, pp. 163\u2013177. Springer, Heidelberg (2006)"},{"issue":"2-3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.tcs.2004.11.007","volume":"336","author":"C. Artho","year":"2005","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), 209\u2013234 (2005)","journal-title":"Theoretical Computer Science"},{"key":"20_CR3","first-page":"24","volume-title":"Proceedings of the 14th Annual IEEE Conference on Computational Complexity (COCO 1999)","author":"D.A.M. Barrington","year":"1999","unstructured":"Barrington, D.A.M., Lu, C.-J., Miltersen, P.B., Skyum, S.: On monotone planar circuits. In: Proceedings of the 14th Annual IEEE Conference on Computational Complexity (COCO 1999), Washington, DC, USA, pp. 24\u201331. IEEE Computer Society Press, Los Alamitos (1999)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Boule, M., Zilic, Z.: Automata-based assertion-checker synthesis of PSL properties. ACM Transactions on Design Automation of Electronic Systems (TODAES)\u00a013(1) (2008)","DOI":"10.1145\/1297666.1297670"},{"key":"20_CR5","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)"},{"key":"20_CR6","first-page":"310","volume-title":"ISQED 2005: Proceedings of the 6th International Symposium on Quality of Electronic Design","author":"A. Dahan","year":"2005","unstructured":"Dahan, A., Geist, D., Gluhovsky, L., Pidan, D., Shapir, G., Wolfsthal, Y., Benalycherif, L., Kamdem, R., Lahbib, Y.: Combining system level modeling with assertion based verification. In: ISQED 2005: Proceedings of the 6th International Symposium on Quality of Electronic Design, Washington, DC, USA, pp. 310\u2013315. IEEE Computer Society, Los Alamitos (2005)"},{"issue":"2","key":"20_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/S0097539792226278","volume":"24","author":"A.L. Delcher","year":"1995","unstructured":"Delcher, A.L., Kosaraju, S.R.: An NC algorithm for evaluating monotone planar circuits. SIAM J. Comput.\u00a024(2), 369\u2013375 (1995)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"20_CR8","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. Inf. Comput.\u00a0174(1), 84\u2013103 (2002)","journal-title":"Inf. Comput."},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0890-5401(89)90009-6","volume":"80","author":"P.W. Dymond","year":"1989","unstructured":"Dymond, P.W., Cook, S.A.: Complexity theory of parallel time and hardware. Information and Computation\u00a080(3), 205\u2013226 (1989)","journal-title":"Information and Computation"},{"key":"20_CR10","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.B.: Checking finite traces using alternating automata. Formal Methods in System Design\u00a024, 101\u2013127 (2004)","journal-title":"Formal Methods in System Design"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0020-0190(80)90117-9","volume":"10","author":"L.M. Goldschlager","year":"1980","unstructured":"Goldschlager, L.M.: A space efficient algorithm for the monotone planar circuit value problem. Inf. Process. Lett.\u00a010(1), 25\u201327 (1980)","journal-title":"Inf. Process. Lett."},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Havelund, K., Ro\u015fu, G.: Efficient monitoring of safety properties. Software Tools for Technology Transfer (2004)","DOI":"10.1007\/s10009-003-0117-6"},{"key":"20_CR13","unstructured":"IEEE Std 1850-2007. Standard for Property Specification Language (PSL). IEEE, New York (2007)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(05)80006-7","volume":"40","author":"T. Jiang","year":"1991","unstructured":"Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. Information Processing Letters\u00a040, 25\u201331 (1991)","journal-title":"Information Processing Letters"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/3-540-53487-3_48","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"S. Rao Kosaraju","year":"1990","unstructured":"Rao Kosaraju, S.: On parallel evaluation of classes of circuits. In: Veni Madhavan, C.E., Nori, K.V. (eds.) FSTTCS 1990. LNCS, vol.\u00a0472, pp. 232\u2013237. Springer, Heidelberg (1990)"},{"key":"20_CR16","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/3-540-15648-8_16","volume-title":"Proceedings of the Conference on Logic of Programs","author":"O. Lichtenstein","year":"1985","unstructured":"Lichtenstein, O., Pnueli, A., Zuck, L.D.: The glory of the past. In: Proceedings of the Conference on Logic of Programs, London, UK, pp. 196\u2013218. Springer, London (1985)"},{"key":"20_CR17","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":"20_CR18","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":"20_CR19","unstructured":"Petersen, H.: Decision problems for generalized regular expressions. In: Proc. 2nd International Workshop on Descriptional Complexity of Automata, Grammars and Related Structures, London (Ontario), pp. 22\u201329 (2000)"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/3-540-45841-7_42","volume-title":"STACS 2002","author":"H. Petersen","year":"2002","unstructured":"Petersen, H.: The membership problem for regular expressions with intersection is complete in LOGCFL. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 513\u2013522. Springer, Heidelberg (2002)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Yang, H.: An NC algorithm for the general planar monotone circuit value problem. In: Proc. 3rd IEEE Symposium on Parallel and Distributed Processing, pp. 196\u2013203 (1991)","DOI":"10.1109\/SPDP.1991.218279"},{"key":"20_CR22","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, p. 223. 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-642-02930-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T01:49:25Z","timestamp":1558403365000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}