{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"status":"public","external_id":{"isi":["000495406300005"]},"citation":{"short":"T. Ferrere, O. Maler, D. Ničković, A. Pnueli, Journal of the ACM 66 (2019).","ama":"Ferrere T, Maler O, Ničković D, Pnueli A. From real-time logic to timed automata. <i>Journal of the ACM</i>. 2019;66(3). doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>","mla":"Ferrere, Thomas, et al. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>, vol. 66, no. 3, 19, ACM, 2019, doi:<a href=\"https://doi.org/10.1145/3286976\">10.1145/3286976</a>.","ieee":"T. Ferrere, O. Maler, D. Ničković, and A. Pnueli, “From real-time logic to timed automata,” <i>Journal of the ACM</i>, vol. 66, no. 3. ACM, 2019.","chicago":"Ferrere, Thomas, Oded Maler, Dejan Ničković, and Amir Pnueli. “From Real-Time Logic to Timed Automata.” <i>Journal of the ACM</i>. ACM, 2019. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>.","ista":"Ferrere T, Maler O, Ničković D, Pnueli A. 2019. From real-time logic to timed automata. Journal of the ACM. 66(3), 19.","apa":"Ferrere, T., Maler, O., Ničković, D., &#38; Pnueli, A. (2019). From real-time logic to timed automata. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3286976\">https://doi.org/10.1145/3286976</a>"},"month":"05","date_created":"2019-11-26T10:22:32Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","publication":"Journal of the ACM","abstract":[{"text":"We show how to construct temporal testers for the logic MITL, a prominent linear-time logic for real-time systems. A temporal tester is a transducer that inputs a signal holding the Boolean value of atomic propositions and outputs the truth value of a formula along time. Here we consider testers over continuous-time Boolean signals that use clock variables to enforce duration constraints, as in timed automata. We first rewrite the MITL formula into a “simple” formula using a limited set of temporal modalities. We then build testers for these specific modalities and show how to compose testers for simple formulae into complex ones. Temporal testers can be turned into acceptors, yielding a compositional translation from MITL to timed automata. This construction is much simpler than previously known and remains asymptotically optimal. It supports both past and future operators and can easily be extended.","lang":"eng"}],"article_number":"19","_id":"7109","doi":"10.1145/3286976","author":[{"full_name":"Ferrere, Thomas","first_name":"Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"last_name":"Ničković","first_name":"Dejan","full_name":"Ničković, Dejan"},{"last_name":"Pnueli","full_name":"Pnueli, Amir","first_name":"Amir"}],"publication_identifier":{"issn":["0004-5411"]},"isi":1,"date_updated":"2023-09-06T11:11:56Z","volume":66,"type":"journal_article","date_published":"2019-05-01T00:00:00Z","publisher":"ACM","year":"2019","article_type":"original","day":"01","issue":"3","oa_version":"None","quality_controlled":"1","scopus_import":"1","title":"From real-time logic to timed automata","intvolume":"        66","language":[{"iso":"eng"}]}