{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:58:49Z","timestamp":1757624329759,"version":"3.44.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031974380"},{"type":"electronic","value":"9783031974397"}],"license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-031-97439-7_12","type":"book-chapter","created":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T11:04:11Z","timestamp":1756551851000},"page":"253-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Note on\u00a0Runtime Verification of\u00a0Concurrent Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3696-9222","authenticated-orcid":false,"given":"Martin","family":"Leucker","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,30]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., McMillan, K., Peled, D.: Deciding global partial-order properties. In: Larsen, K., Skyum, S., Winskel, G. (eds.) Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP\u201998). LNCS, vol.\u00a01443, pp. 41\u201352 (1998). http:\/\/link.springer.de\/link\/service\/series\/0558\/tocs\/t1443.htm","DOI":"10.1007\/BFb0055039"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Peled, D., Penczek, W.: Model checking of causality properties. In: Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science (LICS\u201995), pp. 90\u2013100. IEEE Computer Society Press, San Diego, California (1995)","DOI":"10.1109\/LICS.1995.523247"},{"key":"12_CR3","doi-asserted-by":"publisher","unstructured":"Ang, Z., Mathur, U.: Predictive monitoring against pattern regular languages. Proc. ACM Program. Lang. 8(POPL), pp. 2191\u20132225 (2024). https:\/\/doi.org\/10.1145\/3632915","DOI":"10.1145\/3632915"},{"key":"12_CR4","doi-asserted-by":"publisher","unstructured":"Ang, Z., Mathur, U.: Predictive monitoring with strong trace prefixes. In: Gurfinkel, A., Ganesh, V. (eds.) Computer Aided Verification - 36th International Conference, CAV 2024, Montreal, QC, Canada, July 24-27, 2024, Proceedings, Part II. LNCS, vol. 14682, pp. 182\u2013204. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-65630-9_9","DOI":"10.1007\/978-3-031-65630-9_9"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/11944836_25","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"A Bauer","year":"2006","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Monitoring of Real-Time Properties. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 260\u2013272. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_25"},{"key":"12_CR6","doi-asserted-by":"publisher","unstructured":"Bauer, A., Leucker, M., Schallhart, C.: Runtime verification for LTL and TLTL. ACM Trans. Softw. Eng. Methodol. 20(4), pp. 14:1\u201314:64 (2011). https:\/\/doi.org\/10.1145\/2000799.2000800","DOI":"10.1145\/2000799.2000800"},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Bollig, B., Leucker, M.: Deciding LTL over Mazurkiewicz traces. In: Eigth International Symposium on Temporal Representation and Reasoning, TIME-01, Civdale del Friuli, Italy, June 14-16, 2001, pp. 189\u2013197. IEEE Computer Society (2001). https:\/\/doi.org\/10.1109\/TIME.2001.930717","DOI":"10.1109\/TIME.2001.930717"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0169-023X(02)00136-2","volume":"44","author":"B Bollig","year":"2003","unstructured":"Bollig, B., Leucker, M.: Deciding LTL over Mazurkiewicz traces. Data Knowl. Eng. 44(2), 219\u2013238 (2003)","journal-title":"Data Knowl. Eng."},{"issue":"1","key":"12_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/322234.322243","volume":"28","author":"AK Chandra","year":"1981","unstructured":"Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. J. ACM 28(1), 114\u2013133 (1981)","journal-title":"J. ACM"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45022-X_18","volume-title":"Automata, Languages and Programming","author":"V Diekert","year":"2000","unstructured":"Diekert, V., Gastin, P.: LTL Is Expressively Complete for Mazurkiewicz Traces. In: Montanari, U., Rolim, J.D.P., Welzl, E. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 211\u2013223. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45022-X_18"},{"volume-title":"The Book of Traces","year":"1995","key":"12_CR11","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific, Singapore (1995)"},{"key":"12_CR12","doi-asserted-by":"publisher","unstructured":"Dong, W., Leucker, M., Schallhart, C.: Impartial anticipation in runtime-verification. In: Cha, S.D., Choi, J., Kim, M., Lee, I., Viswanathan, M. (eds.) Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008, Seoul, Korea, October 20-23, 2008. Proceedings. LNCS, vol.\u00a05311, pp. 386\u2013396. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-88387-6_33","DOI":"10.1007\/978-3-540-88387-6_33"},{"key":"12_CR13","doi-asserted-by":"publisher","unstructured":"Dong, W., Leucker, M., Schallhart, C.: Impartial anticipation in runtime-verification. In: Cha, S.D., Choi, J., Kim, M., Lee, I., Viswanathan, M. (eds.) Automated Technology for Verification and Analysis, 6th International Symposium, ATVA 2008, Seoul, Korea, October 20-23, 2008. Proceedings. LNCS, vol.\u00a05311, pp. 386\u2013396. Springer (2008). https:\/\/doi.org\/10.1007\/978-3-540-88387-6_33","DOI":"10.1007\/978-3-540-88387-6_33"},{"issue":"5","key":"12_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/j.jlap.2008.08.004","volume":"78","author":"M Leucker","year":"2009","unstructured":"Leucker, M., Schallhart, C.: A brief account of runtime verification. J. Log. Algebraic Methods Program. 78(5), 293\u2013303 (2009). https:\/\/doi.org\/10.1016\/j.jlap.2008.08.004","journal-title":"J. Log. Algebraic Methods Program."},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Mathur, U., Pavlogiannis, A., Viswanathan, M.: Optimal prediction of synchronization-preserving races. Proc. ACM Program. Lang. 5(POPL), pp. 1\u201329 (2021). https:\/\/doi.org\/10.1145\/3434317","DOI":"10.1145\/3434317"},{"key":"12_CR16","unstructured":"Mazurkiewicz, A.: Basic notions of trace theory. In: de\u00a0Bakker, J.W., de\u00a0Roever, W.P., Rozenberg, G. (eds.) Proceedings of the School\/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. LNCS, vol.\u00a0354, pp. 364\u2013397. Springer (1988)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Mazurkiewicz, A.: Concurrent program schemes and their interpretations. DAIMI Rep. PB\u00a078, Aarhus University, Aarhus (1977)","DOI":"10.7146\/dpb.v6i78.7691"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0304-3975(84)90049-5","volume":"32","author":"S Miyano","year":"1984","unstructured":"Miyano, S., Hayashi, T.: Alternating finite automata on $$\\omega $$-words. Theoret. Comput. Sci. 32, 321\u2013330 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Peled, D., Wilke, T., Wolper, P.: An algorithmic approach for checking closure properties of $$\\omega $$-regular languages. In: Proceedings of the 7th International Conference on Concurrency Theory (CONCUR\u201996). LNCS, vol.\u00a01119, pp. 596\u2013610. Springer, Pisa, Italy (1996)","DOI":"10.1007\/3-540-61604-7_78"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Peled, D., Wilke, T., Wolper, P.: An algorithmic approach for checking closure properties of $$\\omega $$-regular languages. Theor. Comput. Sci. 195(2), 183\u2013203 (1998). a preliminary version appeared in [19]","DOI":"10.1016\/S0304-3975(97)00219-3"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proceedings of the 18th IEEE Symposium on the Foundations of Computer Science (FOCS-77), pp. 46\u201357. IEEE Computer Society Press, Providence, Rhode Island (Oct 31\u2013Nov 2 1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Thiagarajan, P.S.: A trace based extension of linear time temporal logic. In: Proceedings, Ninth Annual IEEE Symposium on Logic in Computer Science, pp. 438\u2013447. IEEE Computer Society Press, Paris, France (4\u20137 Jul 1994)","DOI":"10.1109\/LICS.1994.316047"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Thiagarajan, P.S., Walukiewicz, I.: An expressively complete linear time temporal logic for Mazurkiewicz traces. In: Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pp. 183\u2013194. IEEE Computer Society Press, Warsaw, Poland (29\u00a0Jun\u20132\u00a0Jul 1997)","DOI":"10.1109\/LICS.1997.614946"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1006\/INCO.2001.2956","volume":"179","author":"PS Thiagarajan","year":"2002","unstructured":"Thiagarajan, P.S., Walukiewicz, I.: An expressively complete linear time temporal logic for Mazurkiewicz traces. Inf. Comput. 179(2), 230\u2013249 (2002). https:\/\/doi.org\/10.1006\/INCO.2001.2956","journal-title":"Inf. Comput."},{"key":"12_CR25","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Symposium on Logic in Computer Science (LICS\u201986), pp. 332\u2013345. IEEE Computer Society Press, Washington, D.C., USA (1986)"},{"key":"12_CR26","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: An Automata-Theoretic Approach to Linear Temporal Logic, LNCS, vol.\u00a01043, pp. 238\u2013266. Springer, New York, NY, USA (1996)","DOI":"10.1007\/3-540-60915-6_6"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"Walukiewicz, I.: Difficult configurations - on the complexity of LTrL. In: Larsen, K., Skyum, S., Winskel, G. (eds.) Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP\u201998). LNCS, vol.\u00a01443, pp. 140\u2013151 (1998). http:\/\/www.brics.dk\/~igw\/icalp98.ps","DOI":"10.1007\/BFb0055048"},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Zhang, X., Leucker, M., Dong, W.: Runtime verification with predictive semantics. In: Goodloe, A., Person, S. (eds.) NASA Formal Methods - 4th International Symposium, NFM 2012, Norfolk, VA, USA, April 3-5, 2012. Proceedings. LNCS, vol.\u00a07226, pp. 418\u2013432. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-28891-3_37","DOI":"10.1007\/978-3-642-28891-3_37"}],"container-title":["Lecture Notes in Computer Science","Principles of Formal Quantitative Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97439-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T13:12:54Z","timestamp":1757423574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97439-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"ISBN":["9783031974380","9783031974397"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97439-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,30]]},"assertion":[{"value":"30 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}