{"file":[{"file_size":249789,"date_created":"2018-12-12T10:13:43Z","checksum":"b0ca5f5fbe8a3d20ccbc6f51a344a459","content_type":"application/pdf","file_id":"5028","access_level":"open_access","file_name":"IST-2012-49-v1+1_From_MTL_to_deterministic_timed_automata.pdf","date_updated":"2020-07-14T12:46:27Z","relation":"main_file","creator":"system"}],"oa":1,"_id":"4369","file_date_updated":"2020-07-14T12:46:27Z","day":"08","author":[{"first_name":"Dejan","full_name":"Nickovic, Dejan","last_name":"Nickovic","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Piterman, Nir","first_name":"Nir","last_name":"Piterman"}],"pubrep_id":"49","doi":"10.1007/978-3-642-15297-9_13","has_accepted_license":"1","publist_id":"1090","type":"conference","department":[{"_id":"ToHe"}],"ddc":["004"],"status":"public","citation":{"ista":"Nickovic D, Piterman N. 2010. From MTL to deterministic timed automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 6246, 152–167.","ama":"Nickovic D, Piterman N. From MTL to deterministic timed automata. In: Henzinger TA, Chatterjee K, eds. Vol 6246. Springer; 2010:152-167. doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>","mla":"Nickovic, Dejan, and Nir Piterman. <i>From MTL to Deterministic Timed Automata</i>. Edited by Thomas A. Henzinger and Krishnendu Chatterjee, vol. 6246, Springer, 2010, pp. 152–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">10.1007/978-3-642-15297-9_13</a>.","ieee":"D. Nickovic and N. Piterman, “From MTL to deterministic timed automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria, 2010, vol. 6246, pp. 152–167.","chicago":"Nickovic, Dejan, and Nir Piterman. “From MTL to Deterministic Timed Automata.” edited by Thomas A. Henzinger and Krishnendu Chatterjee, 6246:152–67. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>.","short":"D. Nickovic, N. Piterman, in:, T.A. Henzinger, K. Chatterjee (Eds.), Springer, 2010, pp. 152–167.","apa":"Nickovic, D., &#38; Piterman, N. (2010). From MTL to deterministic timed automata. In T. A. Henzinger &#38; K. Chatterjee (Eds.) (Vol. 6246, pp. 152–167). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15297-9_13\">https://doi.org/10.1007/978-3-642-15297-9_13</a>"},"page":"152 - 167","project":[{"_id":"25EFB36C-B435-11E9-9278-68D0E5697425","name":"COMponent-Based Embedded Systems design Techniques","call_identifier":"FP7","grant_number":"215543"},{"name":"Design for Embedded Systems","_id":"25F1337C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"214373"}],"volume":6246,"scopus_import":1,"alternative_title":["LNCS"],"date_published":"2010-09-08T00:00:00Z","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:08:30Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","conference":{"start_date":"2010-09-08","end_date":"2010-09-10","location":"Klosterneuburg, Austria","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"abstract":[{"text":"In this paper we propose a novel technique for constructing timed automata from properties expressed in the logic mtl, under bounded-variability assumptions. We handle full mtl and include all future operators. Our construction is based on separation of the continuous time monitoring of the input sequence and discrete predictions regarding the future. The separation of the continuous from the discrete allows us to determinize our automata in an exponential construction that does not increase the number of clocks. This leads to a doubly exponential construction from mtl to deterministic timed automata, compared with triply exponential using existing approaches. We offer an alternative to the existing approach to linear real-time model checking, which has never been implemented. It further offers a unified framework for model checking, runtime monitoring, and synthesis, in an approach that can reuse tools, implementations, and insights from the discrete setting.","lang":"eng"}],"date_updated":"2021-01-12T07:56:27Z","ec_funded":1,"publication_status":"published","intvolume":"      6246","title":"From MTL to deterministic timed automata","publisher":"Springer","month":"09","oa_version":"Submitted Version","year":"2010","editor":[{"last_name":"Henzinger","first_name":"Thomas A.","full_name":"Henzinger, Thomas A."},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"}]}