{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:10:33Z","timestamp":1769980233533,"version":"3.49.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030582975","type":"print"},{"value":"9783030582982","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58298-2_11","type":"book-chapter","created":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T18:04:52Z","timestamp":1598637892000},"page":"252-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Temporal-Logic Query Checking over Finite Data Streams"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7209-550X","authenticated-orcid":false,"given":"Samuel","family":"Huang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4952-5380","authenticated-orcid":false,"given":"Rance","family":"Cleaveland","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,29]]},"reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-16612-9_1","volume-title":"Runtime Verification","author":"C Ackermann","year":"2010","unstructured":"Ackermann, C., Cleaveland, R., Huang, S., Ray, A., Shelton, C., Latronico, E.: Automatic requirement extraction from test cases. In: Barringer, H., Falcone, Y., Finkbeiner, B., Havelund, K., Lee, I., Pace, G., Ro\u015fu, G., Sokolsky, O., Tillmann, N. (eds.) RV 2010. LNCS, vol. 6418, pp. 1\u201315. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16612-9_1"},{"key":"11_CR2","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering, pp. 3\u201314. IEEE Computer Society, Washington, DC (1995)"},{"issue":"8","key":"11_CR3","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1006\/eujc.1996.0059","volume":"17","author":"R Ahlswede","year":"1996","unstructured":"Ahlswede, R., Cai, N.: Incomparability and intersection properties of Boolean interval lattices and chain posets. Eur. J. Comb. 17(8), 677\u2013687 (1996). https:\/\/doi.org\/10.1006\/eujc.1996.0059","journal-title":"Eur. J. Comb."},{"issue":"1","key":"11_CR4","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/227595.227602","volume":"43","author":"R Alur","year":"1996","unstructured":"Alur, R., Feder, T., Henzinger, T.A.: The benefits of relaxing punctuality. J. ACM (JACM) 43(1), 116\u2013146 (1996)","journal-title":"J. ACM (JACM)"},{"key":"11_CR5","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P.: Principles of Model Checking. MIT Press, Cambridge (2008)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(88)90098-9","volume":"59","author":"M Browne","year":"1988","unstructured":"Browne, M., Clarke, E., Grumberg, O.: Characterizing finite Kripke structures in propositional temporal logic. Theor. Comput. Sci. 59(1), 115\u2013131 (1988). https:\/\/doi.org\/10.1016\/0304-3975(88)90098-9","journal-title":"Theor. Comput. Sci."},{"key":"11_CR7","doi-asserted-by":"publisher","unstructured":"Bruns, G., Godefroid, P.: Temporal logic query checking. In: Proceedings 16th Annual IEEE Symposium on Logic in Computer Science, pp. 409\u2013417, June 2001. https:\/\/doi.org\/10.1109\/LICS.2001.932516","DOI":"10.1109\/LICS.2001.932516"},{"key":"11_CR8","unstructured":"Causality workbench team: PROMO: simple causal effects in time series, August 2008. https:\/\/data.world\/data-society\/causal-effects-in-time-series"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/10722167_34","volume-title":"Computer Aided Verification","author":"W Chan","year":"2000","unstructured":"Chan, W.: Temporal-logic queries. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 450\u2013463. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_34"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-642-19583-9_11","volume-title":"Hardware and Software: Verification and Testing","author":"H Chockler","year":"2011","unstructured":"Chockler, H., Gurfinkel, A., Strichman, O.: Variants of LTL query checking. In: Barner, S., Harris, I., Kroening, D., Raz, O. (eds.) HVC 2010. LNCS, vol. 6504, pp. 76\u201392. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19583-9_11"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/BFb0025774","volume-title":"Logics of Programs","author":"EM Clarke","year":"1982","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching time temporal logic. In: Kozen, D. (ed.) Logic of Programs 1981. LNCS, vol. 131, pp. 52\u201371. Springer, Heidelberg (1982). https:\/\/doi.org\/10.1007\/BFb0025774"},{"key":"11_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of Model Checking","author":"EM Clarke","year":"2018","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R.: Handbook of Model Checking. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"De Giacomo, G., De Masellis, R., Montali, M.: Reasoning on LTL on finite traces: insensitivity to infiniteness. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI 2014, Qu\u00e9bec City, Qu\u00e9bec, Canada , pp. 1027\u20131033. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8872"},{"key":"11_CR14","unstructured":"De Giacomo, G., Vardi, M.Y.: Linear temporal logic and linear dynamic logic on finite traces. In: Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, IJCAI 2013, Beijing, China, pp. 854\u2013860. AAAI Press (2013)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-319-46520-3_8","volume-title":"Automated Technology for Verification and Analysis","author":"A Duret-Lutz","year":"2016","unstructured":"Duret-Lutz, A., Lewkowicz, A., Fauchille, A., Michaud, T., Renault, \u00c9., Xu, L.: Spot 2.0 \u2014 a framework for LTL and $$\\omega $$-automata manipulation. In: Artho, C., Legay, A., Peled, D. (eds.) ATVA 2016. LNCS, vol. 9938, pp. 122\u2013129. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46520-3_8"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1007\/978-3-319-10575-8_24","volume-title":"Handbook of Model Checking","author":"C Eisner","year":"2018","unstructured":"Eisner, C., Fisman, D.: Functional specification of hardware via temporal logic. In: Clarke, E., Henzinger, T., Veith, H., Bloem, R. (eds.) Handbook of Model Checking, pp. 795\u2013829. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_24"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Fionda, V., Greco, G.: The complexity of LTL on finite traces: hard and easy fragments. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI 2016, Phoenix, Arizona, pp. 971\u2013977. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10104"},{"issue":"3","key":"11_CR18","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/s10115-014-0817-0","volume":"45","author":"D Fradkin","year":"2015","unstructured":"Fradkin, D., M\u00f6rchen, F.: Mining sequential patterns for classification. Knowl. Inf. Syst. 45(3), 731\u2013749 (2015). https:\/\/doi.org\/10.1007\/s10115-014-0817-0","journal-title":"Knowl. Inf. Syst."},{"key":"11_CR19","doi-asserted-by":"publisher","unstructured":"Georgala, K., Sherif, M.A., Ngomo, A.C.N.: An efficient approach for the generation of Allen relations. In: Proceedings of the Twenty-Second European Conference on Artificial Intelligence, ECAI 2016, The Hague, The Netherlands, pp. 948\u2013956. IOS Press (2016). https:\/\/doi.org\/10.3233\/978-1-61499-672-9-948","DOI":"10.3233\/978-1-61499-672-9-948"},{"issue":"10","key":"11_CR20","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1109\/TSE.2003.1237171","volume":"29","author":"A Gurfinkel","year":"2003","unstructured":"Gurfinkel, A., Chechik, M., Devereux, B.: Temporal logic query checking: a tool for model exploration. IEEE Trans. Softw. Eng. 29(10), 898\u2013914 (2003). https:\/\/doi.org\/10.1109\/TSE.2003.1237171","journal-title":"IEEE Trans. Softw. Eng."},{"key":"11_CR21","volume-title":"The SPIN Model Checker: Primer and Reference Manual","author":"GJ Holzmann","year":"2004","unstructured":"Holzmann, G.J.: The SPIN Model Checker: Primer and Reference Manual, vol. 1003. Addison-Wesley, Reading (2004)"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/978-3-319-67113-0_3","volume-title":"Critical Systems: Formal Methods and Automated Verification","author":"S Huang","year":"2017","unstructured":"Huang, S., Cleaveland, R.: Query checking for linear temporal logic. In: Petrucci, L., Seceleanu, C., Cavalcanti, A. (eds.) FMICS\/AVoCS -2017. LNCS, vol. 10471, pp. 34\u201348. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-67113-0_3"},{"key":"11_CR23","unstructured":"Huang, S., Cleaveland, R.: A tableau construction for finite linear-time temporal logic. arXiv preprint arXiv:1910.09339 (2019)"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Huang, S., Cleaveland, R.: Temporal-logic query checking over finite data streams. arXiv preprint arXiv:2006.03751 (2020)","DOI":"10.1007\/978-3-030-58298-2_11"},{"issue":"3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/0304-3975(82)90125-6","volume":"27","author":"D Kozen","year":"1983","unstructured":"Kozen, D.: Results on the propositional $$\\mu $$-calculus. Theor. Comput. Sci. 27(3), 333\u2013354 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"11_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-319-56841-6_5","volume-title":"Engineering Trustworthy Software Systems","author":"M Leucker","year":"2017","unstructured":"Leucker, M.: Runtime verification for linear-time temporal logic. In: Bowen, J.P., Liu, Z., Zhang, Z. (eds.) SETSS 2016. LNCS, vol. 10215, pp. 151\u2013194. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56841-6_5"},{"key":"11_CR27","doi-asserted-by":"publisher","first-page":"e103","DOI":"10.7717\/peerj-cs.103","volume":"3","author":"A Meurer","year":"2017","unstructured":"Meurer, A., Smith, C.P., et al.: SymPy: symbolic computing in Python. PeerJ Comput. Sci. 3, e103 (2017). https:\/\/doi.org\/10.7717\/peerj-cs.103","journal-title":"PeerJ Comput. Sci."},{"key":"11_CR28","doi-asserted-by":"publisher","unstructured":"Pnueli, A.: The temporal logic of programs. In: 18th Annual Symposium on Foundations of Computer Science, pp. 46\u201357, October 1977. https:\/\/doi.org\/10.1109\/SFCS.1977.32","DOI":"10.1109\/SFCS.1977.32"},{"key":"11_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-319-46982-9_21","volume-title":"Runtime Verification","author":"G Ro\u015fu","year":"2016","unstructured":"Ro\u015fu, G.: Finite-trace linear temporal logic: coinductive completeness. In: Falcone, Y., S\u00e1nchez, C. (eds.) RV 2016. LNCS, vol. 10012, pp. 333\u2013350. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-46982-9_21"},{"key":"11_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/11817963_25","volume-title":"Computer Aided Verification","author":"G Ro\u015fu","year":"2006","unstructured":"Ro\u015fu, G., Bensalem, S.: Allen linear (interval) temporal logic \u2013 translation to LTL and monitor synthesis. In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 263\u2013277. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11817963_25"},{"issue":"3","key":"11_CR31","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1145\/3828.3837","volume":"32","author":"AP Sistla","year":"1985","unstructured":"Sistla, A.P., Clarke, E.M.: The complexity of propositional linear temporal logics. J. ACM (JACM) 32(3), 733\u2013749 (1985)","journal-title":"J. ACM (JACM)"},{"key":"11_CR32","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proceedings of the First Symposium on Logic in Computer Science, pp. 322\u2013331. IEEE Computer Society (1986)"},{"issue":"110\u2013111","key":"11_CR33","first-page":"119","volume":"28","author":"P Wolper","year":"1985","unstructured":"Wolper, P.: The tableau method for temporal logic: an overview. Logique Et Analyse 28(110\u2013111), 119\u2013136 (1985)","journal-title":"Logique Et Analyse"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58298-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T06:03:49Z","timestamp":1707458629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58298-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030582975","9783030582982"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58298-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"29 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FMICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Methods for Industrial Critical Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fmics2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/fmics20.ait.ac.at\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}