{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:21:59Z","timestamp":1743114119455,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030850364"},{"type":"electronic","value":"9783030850371"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85037-1_2","type":"book-chapter","created":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T23:03:01Z","timestamp":1629068581000},"page":"15-31","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of Timed Pattern Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7983-2202","authenticated-orcid":false,"given":"Eugene","family":"Asarin","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Ferr\u00e8re","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5468-0396","authenticated-orcid":false,"given":"Dejan","family":"Ni\u010dkovi\u0107","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5090-1769","authenticated-orcid":false,"given":"Dogan","family":"Ulus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,16]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R Alur","year":"1994","unstructured":"Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994). https:\/\/doi.org\/10.1016\/0304-3975(94)90010-8","journal-title":"Theor. Comput. Sci."},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Asarin, E., Caspi, P., Maler, O.: A Kleene theorem for timed automata. In: LICS, pp. 160\u2013171 (1997). https:\/\/doi.org\/10.1109\/LICS.1997.614944","DOI":"10.1109\/LICS.1997.614944"},{"issue":"2","key":"2_CR3","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1145\/506147.506151","volume":"49","author":"E Asarin","year":"2002","unstructured":"Asarin, E., Caspi, P., Maler, O.: Timed regular expressions. J. ACM 49(2), 172\u2013206 (2002). https:\/\/doi.org\/10.1145\/506147.506151","journal-title":"J. ACM"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-65765-3_11","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A Bakhirkin","year":"2017","unstructured":"Bakhirkin, A., Ferr\u00e8re, T., Maler, O., Ulus, D.: On the quantitative semantics of regular expressions over real-valued signals. In: Abate, A., Geeraerts, G. (eds.) FORMATS 2017. LNCS, vol. 10419, pp. 189\u2013206. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65765-3_11"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-00151-3_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A Bakhirkin","year":"2018","unstructured":"Bakhirkin, A., Ferr\u00e8re, T., Nickovic, D., Maler, O., Asarin, E.: Online timed pattern matching using automata. In: Jansen, D.N., Prabhakar, P. (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 215\u2013232. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00151-3_13"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"371","DOI":"10.25596\/jalc-2000-371","volume":"5","author":"C Choffrut","year":"2000","unstructured":"Choffrut, C., Goldwurm, M.: Timed automata with periodic clock constraints. J. Autom. Lang. Comb. 5(4), 371\u2013403 (2000). https:\/\/doi.org\/10.25596\/jalc-2000-371","journal-title":"J. Autom. Lang. Comb."},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.25596\/jalc-2001-003","volume":"6","author":"C Dima","year":"2001","unstructured":"Dima, C.: Real-time automata. J. Autom. Lang. Comb. 6(1), 3\u201323 (2001). https:\/\/doi.org\/10.25596\/jalc-2001-003","journal-title":"J. Autom. Lang. Comb."},{"issue":"5","key":"2_CR8","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1016\/j.orl.2005.09.008","volume":"34","author":"F Eisenbrand","year":"2006","unstructured":"Eisenbrand, F., Shmonin, G.: Carath\u00e9odory bounds for integer cones. Oper. Res. Lett. 34(5), 564\u2013568 (2006). https:\/\/doi.org\/10.1016\/j.orl.2005.09.008","journal-title":"Oper. Res. Lett."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.ic.2014.12.004","volume":"243","author":"J Fearnley","year":"2015","unstructured":"Fearnley, J., Jurdzinski, M.: Reachability in two-clock timed automata is PSPACE-complete. Inf. Comput. 243, 26\u201336 (2015). https:\/\/doi.org\/10.1016\/j.ic.2014.12.004","journal-title":"Inf. Comput."},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-00151-3_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"A Bakhirkin","year":"2018","unstructured":"Bakhirkin, A., Ferr\u00e8re, T., Nickovic, D., Maler, O., Asarin, E.: Online timed pattern matching using automata. In: Jansen, D.N., Prabhakar, Pavithra (eds.) FORMATS 2018. LNCS, vol. 11022, pp. 215\u2013232. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00151-3_13"},{"key":"2_CR11","doi-asserted-by":"publisher","unstructured":"Haase, C., Zetzsche, G.: Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. In: LICS, pp. 1\u201314 (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785850","DOI":"10.1109\/LICS.2019.8785850"},{"key":"2_CR12","unstructured":"Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley (1979)"},{"key":"2_CR13","doi-asserted-by":"publisher","unstructured":"Narayan, A., Cutulenco, G., Joshi, Y., Fischmeister, S.: Mining timed regular specifications from system traces. ACM Trans. Embed. Comput. Syst. 17(2),(2018). https:\/\/doi.org\/10.1145\/3147660","DOI":"10.1145\/3147660"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-319-89963-3_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Ni\u010dkovi\u0107","year":"2018","unstructured":"Ni\u010dkovi\u0107, D., Lebeltel, O., Maler, O., Ferr\u00e8re, T., Ulus, D.: AMT\u00a02.0: qualitative and quantitative trace analysis with extended signal temporal logic. In: Beyer, D., Huisman, M. (eds.) TACAS 2018. LNCS, vol. 10806, pp. 303\u2013319. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89963-3_18"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/978-3-030-32079-9_17","volume-title":"Runtime Verification","author":"D Ni\u010dkovi\u0107","year":"2019","unstructured":"Ni\u010dkovi\u0107, D., Qin, X., Ferr\u00e8re, T., Mateis, C., Deshmukh, J.: Shape expressions for specifying and extracting signal features. In: Finkbeiner, B., Mariani, L. (eds.) RV 2019. LNCS, vol. 11757, pp. 292\u2013309. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-32079-9_17"},{"key":"2_CR16","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. 2285, pp. 513\u2013522. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45841-7_42"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-540-70545-1_25","volume-title":"Computer Aided Verification","author":"R Piskac","year":"2008","unstructured":"Piskac, R., Kuncak, V.: Linear arithmetic with stars. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 268\u2013280. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_25"},{"key":"2_CR18","doi-asserted-by":"publisher","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time (preliminary report). In: STOC, pp. 1\u20139. ACM (1973). https:\/\/doi.org\/10.1145\/800125.804029","DOI":"10.1145\/800125.804029"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-319-63387-9_16","volume-title":"Computer Aided Verification","author":"D Ulus","year":"2017","unstructured":"Ulus, D.: Montre: a tool for monitoring timed regular expressions. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 329\u2013335. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_16"},{"key":"2_CR20","unstructured":"Ulus, D.: Pattern matching with time: theory and applications. Ph.D. thesis, Universit\u00e9 Grenoble Alpes (2018). https:\/\/hal.archives-ouvertes.fr\/tel-01901576"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-319-10512-3_16","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"D Ulus","year":"2014","unstructured":"Ulus, D., Ferr\u00e8re, T., Asarin, E., Maler, O.: Timed pattern matching. In: Legay, A., Bozga, M. (eds.) FORMATS 2014. LNCS, vol. 8711, pp. 222\u2013236. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10512-3_16"},{"key":"2_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/978-3-662-49674-9_47","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Ulus","year":"2016","unstructured":"Ulus, D., Ferr\u00e8re, T., Asarin, E., Maler, O.: Online timed pattern matching using derivatives. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 736\u2013751. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_47"},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-44878-7_8","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Waga","year":"2016","unstructured":"Waga, M., Akazaki, T., Hasuo, I.: A Boyer-Moore type algorithm for timed pattern matching. In: Fr\u00e4nzle, M., Markey, N. (eds.) FORMATS 2016. LNCS, vol. 9884, pp. 121\u2013139. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44878-7_8"},{"key":"2_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-030-20652-9_26","volume-title":"NASA Formal Methods","author":"M Waga","year":"2019","unstructured":"Waga, M., Andr\u00e9, E.: Online parametric timed pattern matching with automata-based skipping. In: Badger, J.M., Rozier, K.Y. (eds.) NFM 2019. LNCS, vol. 11460, pp. 371\u2013389. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-20652-9_26"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-319-65765-3_13","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"M Waga","year":"2017","unstructured":"Waga, M., Hasuo, I., Suenaga, K.: Efficient online timed pattern matching by automata-based skipping. In: Abate, A., Geeraerts, G. (eds.) FORMATS 2017. LNCS, vol. 10419, pp. 224\u2013243. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-65765-3_13"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85037-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,15]],"date-time":"2021-08-15T23:05:51Z","timestamp":1629068751000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85037-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030850364","9783030850371"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85037-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paris","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/qonfest2021.lacl.fr\/","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":"19","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":"8","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":"2,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)"}}]}}