{"alternative_title":["LNCS"],"_id":"78","conference":{"start_date":"2018-09-04","end_date":"2018-09-06","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","location":"Bejing, China"},"doi":"10.1007/978-3-030-00151-3_13","author":[{"full_name":"Bakhirkin, Alexey","first_name":"Alexey","last_name":"Bakhirkin"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","last_name":"Ferrere","orcid":"0000-0001-5199-3143","first_name":"Thomas","full_name":"Ferrere, Thomas"},{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"},{"last_name":"Asarin","first_name":"Eugene","full_name":"Asarin, Eugene"}],"abstract":[{"lang":"eng","text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated."}],"publication_status":"published","type":"conference","has_accepted_license":"1","date_updated":"2023-09-13T09:35:46Z","volume":11022,"publication_identifier":{"isbn":["978-3-030-00150-6"]},"isi":1,"external_id":{"isi":["000884993200013"]},"status":"public","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"page":"215 - 232","oa":1,"file_date_updated":"2020-07-14T12:48:03Z","ddc":["000"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ToHe"}],"article_processing_charge":"No","month":"08","date_created":"2018-12-11T11:44:31Z","citation":{"ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>","mla":"Bakhirkin, Alexey, et al. <i>Online Timed Pattern Matching Using Automata</i>. Vol. 11022, Springer, 2018, pp. 215–32, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>.","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., &#38; Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>"},"quality_controlled":"1","scopus_import":"1","title":"Online timed pattern matching using automata","oa_version":"Submitted Version","publist_id":"7976","language":[{"iso":"eng"}],"file":[{"checksum":"436b7574934324cfa7d1d3986fddc65b","date_created":"2020-05-14T11:34:34Z","relation":"main_file","file_name":"2018_LNCS_Bakhirkin.pdf","access_level":"open_access","date_updated":"2020-07-14T12:48:03Z","creator":"dernst","file_id":"7831","content_type":"application/pdf","file_size":374851}],"intvolume":"     11022","day":"26","publisher":"Springer","year":"2018","date_published":"2018-08-26T00:00:00Z"}