[{"month":"08","oa_version":"Submitted Version","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"has_accepted_license":"1","conference":{"end_date":"2018-09-06","location":"Bejing, China","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2018-09-04"},"language":[{"iso":"eng"}],"publist_id":"7976","oa":1,"publication_identifier":{"isbn":["978-3-030-00150-6"]},"date_published":"2018-08-26T00:00:00Z","type":"conference","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"creator":"dernst","file_id":"7831","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2018_LNCS_Bakhirkin.pdf","date_updated":"2020-07-14T12:48:03Z","file_size":374851,"checksum":"436b7574934324cfa7d1d3986fddc65b","date_created":"2020-05-14T11:34:34Z"}],"alternative_title":["LNCS"],"title":"Online timed pattern matching using automata","intvolume":"     11022","publication_status":"published","date_created":"2018-12-11T11:44:31Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","author":[{"last_name":"Bakhirkin","first_name":"Alexey","full_name":"Bakhirkin, Alexey"},{"orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"full_name":"Maler, Oded","last_name":"Maler","first_name":"Oded"},{"last_name":"Asarin","first_name":"Eugene","full_name":"Asarin, Eugene"}],"_id":"78","scopus_import":"1","publisher":"Springer","file_date_updated":"2020-07-14T12:48:03Z","page":"215 - 232","quality_controlled":"1","abstract":[{"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.","lang":"eng"}],"doi":"10.1007/978-3-030-00151-3_13","day":"26","isi":1,"external_id":{"isi":["000884993200013"]},"date_updated":"2023-09-13T09:35:46Z","year":"2018","citation":{"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>.","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.","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>","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>","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.","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","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>."},"ddc":["000"],"volume":11022},{"language":[{"iso":"eng"}],"conference":{"name":"QEST: Quantitative Evaluation of Systems","start_date":"2018-09-04","end_date":"2018-09-07","location":"Beijing, China"},"oa_version":"Preprint","month":"08","main_file_link":[{"url":"https://arxiv.org/abs/1806.05126","open_access":"1"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","date_published":"2018-08-15T00:00:00Z","type":"conference","publist_id":"7975","oa":1,"page":"53-70","quality_controlled":"1","publisher":"Springer","_id":"79","scopus_import":"1","author":[{"first_name":"Sebastian","last_name":"Arming","full_name":"Arming, Sebastian"},{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Katoen, Joost P","last_name":"Katoen","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sokolova","first_name":"Ana","full_name":"Sokolova, Ana"}],"publication_status":"published","date_created":"2018-12-11T11:44:31Z","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"title":"Parameter-independent strategies for pMDPs via POMDPs","alternative_title":["LNCS"],"intvolume":"     11024","volume":11024,"date_updated":"2023-09-13T09:38:28Z","citation":{"ama":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>","apa":"Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &#38; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>","ieee":"S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.","chicago":"Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>.","mla":"Arming, Sebastian, et al. <i>Parameter-Independent Strategies for PMDPs via POMDPs</i>. Vol. 11024, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>.","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70.","ista":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70."},"year":"2018","isi":1,"external_id":{"isi":["000548912200004"],"arxiv":["1806.05126"]},"doi":"10.1007/978-3-319-99154-2_4","arxiv":1,"day":"15","abstract":[{"lang":"eng","text":"Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol."}]},{"year":"2018","citation":{"ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>","apa":"Elgyütt, A., Ferrere, T., &#38; Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>","chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>.","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.","short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.","mla":"Elgyütt, Adrian, et al. <i>Monitoring Temporal Logic with Clock Variables</i>. Vol. 11022, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>.","ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70."},"date_updated":"2023-09-13T08:58:34Z","external_id":{"isi":["000884993200004"]},"isi":1,"day":"26","doi":"10.1007/978-3-030-00151-3_4","abstract":[{"lang":"eng","text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,"}],"volume":11022,"ddc":["000"],"scopus_import":"1","_id":"81","author":[{"last_name":"Elgyütt","first_name":"Adrian","full_name":"Elgyütt, Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A"}],"article_processing_charge":"No","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:44:31Z","publication_status":"published","intvolume":"     11022","title":"Monitoring temporal logic with clock variables","alternative_title":["LNCS"],"quality_controlled":"1","page":"53 - 70","file_date_updated":"2020-10-09T06:24:21Z","publisher":"Springer","type":"conference","date_published":"2018-08-26T00:00:00Z","oa":1,"publist_id":"7973","file":[{"access_level":"open_access","relation":"main_file","success":1,"creator":"dernst","file_id":"8638","file_size":537219,"checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","date_created":"2020-10-09T06:24:21Z","file_name":"2018_LNCS_Elgyuett.pdf","content_type":"application/pdf","date_updated":"2020-10-09T06:24:21Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","has_accepted_license":"1","project":[{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","call_identifier":"FWF","_id":"25F5A88A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Submitted Version","month":"08","language":[{"iso":"eng"}],"conference":{"end_date":"2018-09-06","location":"Beijing, China","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2018-09-04"}},{"abstract":[{"lang":"eng","text":"Responsiveness—the requirement that every request to a system be eventually handled—is one of the fundamental liveness properties of a reactive system. Average response time is a quantitative measure for the responsiveness requirement used commonly in performance evaluation. We show how average response time can be computed on state-transition graphs, on Markov chains, and on game graphs. In all three cases, we give polynomial-time algorithms."}],"day":"20","doi":"10.1007/978-3-319-95246-8_9","year":"2018","citation":{"ista":"Chatterjee K, Henzinger TA, Otop J. 2018.Computing average response time. In: Principles of Modeling. LNCS, vol. 10760, 143–161.","mla":"Chatterjee, Krishnendu, et al. “Computing Average Response Time.” <i>Principles of Modeling</i>, edited by Marten Lohstroh et al., vol. 10760, Springer, 2018, pp. 143–61, doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>.","short":"K. Chatterjee, T.A. Henzinger, J. Otop, in:, M. Lohstroh, P. Derler, M. Sirjani (Eds.), Principles of Modeling, Springer, 2018, pp. 143–161.","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Jan Otop. “Computing Average Response Time.” In <i>Principles of Modeling</i>, edited by Marten Lohstroh, Patricia Derler, and Marjan Sirjani, 10760:143–61. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>.","ieee":"K. Chatterjee, T. A. Henzinger, and J. Otop, “Computing average response time,” in <i>Principles of Modeling</i>, vol. 10760, M. Lohstroh, P. Derler, and M. Sirjani, Eds. Springer, 2018, pp. 143–161.","apa":"Chatterjee, K., Henzinger, T. A., &#38; Otop, J. (2018). Computing average response time. In M. Lohstroh, P. Derler, &#38; M. Sirjani (Eds.), <i>Principles of Modeling</i> (Vol. 10760, pp. 143–161). Springer. <a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">https://doi.org/10.1007/978-3-319-95246-8_9</a>","ama":"Chatterjee K, Henzinger TA, Otop J. Computing average response time. In: Lohstroh M, Derler P, Sirjani M, eds. <i>Principles of Modeling</i>. Vol 10760. Springer; 2018:143-161. doi:<a href=\"https://doi.org/10.1007/978-3-319-95246-8_9\">10.1007/978-3-319-95246-8_9</a>"},"date_updated":"2021-01-12T08:20:14Z","ddc":["000"],"volume":10760,"acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23, S11407-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), ERC Start grant (279307: Graph Games), Vienna Science and Technology Fund (WWTF) through project ICT15-003 and by the National Science Centre (NCN), Poland under grant 2014/15/D/ST6/04543.","intvolume":"     10760","alternative_title":["LNCS"],"title":"Computing average response time","date_created":"2018-12-11T11:44:33Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"publication_status":"published","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"2FC5DA74-F248-11E8-B48F-1D18A9856A87","last_name":"Otop","first_name":"Jan","full_name":"Otop, Jan"}],"scopus_import":1,"_id":"86","editor":[{"last_name":"Lohstroh","first_name":"Marten","full_name":"Lohstroh, Marten"},{"last_name":"Derler","first_name":"Patricia","full_name":"Derler, Patricia"},{"last_name":"Sirjani","first_name":"Marjan","full_name":"Sirjani, Marjan"}],"publisher":"Springer","file_date_updated":"2020-07-14T12:48:14Z","ec_funded":1,"quality_controlled":"1","page":"143 - 161","publist_id":"7968","oa":1,"type":"book_chapter","date_published":"2018-07-20T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"creator":"dernst","file_id":"7053","relation":"main_file","access_level":"open_access","file_name":"2018_PrinciplesModeling_Chatterjee.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:48:14Z","checksum":"9995c6ce6957333baf616fc4f20be597","file_size":516307,"date_created":"2019-11-19T08:22:18Z"}],"month":"07","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"oa_version":"Submitted Version","has_accepted_license":"1","publication":"Principles of Modeling","language":[{"iso":"eng"}]},{"type":"conference","date_published":"2018-04-11T00:00:00Z","publication_identifier":{"isbn":["978-1-4503-5642-8 "]},"publist_id":"7739","oa":1,"file":[{"creator":"dernst","file_id":"7833","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_name":"2018_HSCC_Bakhirkin.pdf","date_updated":"2020-07-14T12:45:17Z","checksum":"81eabc96430e84336ea88310ac0a1ad0","file_size":5900421,"date_created":"2020-05-14T12:18:29Z"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","publication":"Proceedings of the 21st International Conference on Hybrid Systems","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"}],"oa_version":"Submitted Version","month":"04","language":[{"iso":"eng"}],"conference":{"end_date":"2018-04-13","location":"Porto, Portugal","name":"HSCC: Hybrid Systems: Computation and Control","start_date":"2018-04-11"},"year":"2018","citation":{"ama":"Bakhirkin A, Ferrere T, Maler O. Efficient parametric identification for STL. In: <i>Proceedings of the 21st International Conference on Hybrid Systems</i>. ACM; 2018:177-186. doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>","apa":"Bakhirkin, A., Ferrere, T., &#38; Maler, O. (2018). Efficient parametric identification for STL. In <i>Proceedings of the 21st International Conference on Hybrid Systems</i> (pp. 177–186). Porto, Portugal: ACM. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>","ieee":"A. Bakhirkin, T. Ferrere, and O. Maler, “Efficient parametric identification for STL,” in <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, Porto, Portugal, 2018, pp. 177–186.","chicago":"Bakhirkin, Alexey, Thomas Ferrere, and Oded Maler. “Efficient Parametric Identification for STL.” In <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, 177–86. ACM, 2018. <a href=\"https://doi.org/10.1145/3178126.3178132\">https://doi.org/10.1145/3178126.3178132</a>.","short":"A. Bakhirkin, T. Ferrere, O. Maler, in:, Proceedings of the 21st International Conference on Hybrid Systems, ACM, 2018, pp. 177–186.","mla":"Bakhirkin, Alexey, et al. “Efficient Parametric Identification for STL.” <i>Proceedings of the 21st International Conference on Hybrid Systems</i>, ACM, 2018, pp. 177–86, doi:<a href=\"https://doi.org/10.1145/3178126.3178132\">10.1145/3178126.3178132</a>.","ista":"Bakhirkin A, Ferrere T, Maler O. 2018. Efficient parametric identification for STL. Proceedings of the 21st International Conference on Hybrid Systems. HSCC: Hybrid Systems: Computation and Control, HSCC Proceedings, , 177–186."},"date_updated":"2023-09-11T13:30:51Z","external_id":{"isi":["000474781600020"]},"isi":1,"day":"11","doi":"10.1145/3178126.3178132","abstract":[{"lang":"eng","text":"We describe a new algorithm for the parametric identification problem for signal temporal logic (STL), stated as follows. Given a densetime real-valued signal w and a parameterized temporal logic formula φ, compute the subset of the parameter space that renders the formula satisfied by the signal. Unlike previous solutions, which were based on search in the parameter space or quantifier elimination, our procedure works recursively on φ and computes the evolution over time of the set of valid parameter assignments. This procedure is similar to that of monitoring or computing the robustness of φ relative to w. Our implementation and experiments demonstrate that this approach can work well in practice."}],"ddc":["000"],"scopus_import":"1","_id":"182","author":[{"full_name":"Bakhirkin, Alexey","first_name":"Alexey","last_name":"Bakhirkin"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas"},{"full_name":"Maler, Oded","first_name":"Oded","last_name":"Maler"}],"department":[{"_id":"ToHe"}],"article_processing_charge":"No","date_created":"2018-12-11T11:45:04Z","publication_status":"published","title":"Efficient parametric identification for STL","alternative_title":["HSCC Proceedings"],"quality_controlled":"1","page":"177 - 186","file_date_updated":"2020-07-14T12:45:17Z","publisher":"ACM"},{"publisher":"Association for Computing Machinery, Inc","quality_controlled":"1","page":"197 - 206","article_processing_charge":"No","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:45:04Z","publication_status":"published","alternative_title":["HSCC Proceedings"],"title":"Localizing faults in simulink/stateflow models with STL","scopus_import":"1","_id":"183","author":[{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas","first_name":"Thomas","last_name":"Ferrere","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Niveditha","last_name":"Manjunath","full_name":"Manjunath, Niveditha"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"}],"acknowledgement":"This work was partially supported by the Austrian Science Fund (FWF) under grants S11402-N23 and S11405-N23 (RiSE/SHiNE), the CPS/IoT project (HRSM), the EU ICT COST Action IC1402 on Run-time Verification beyond Monitoring (ARVI), the AMASS project (ECSEL 692474), and the ENABLE-S3 project (ECSEL 692455). The CPS/IoT project receives support from the Austrian government through the Federal Ministry of Science, Research and Economy (BMWFW) in the funding program Hochschulraum-Strukturmittel (HRSM) 2016. The ECSEL Joint Undertaking receives support from the European Union’s Horizon 2020 research and innovation programme and Austria, Denmark, Germany, Finland, Czech Republic, Italy, Spain, Portugal, Poland, Ireland, Belgium, France, Netherlands, United Kingdom, Slovakia, Norway.","day":"11","doi":"10.1145/3178126.3178131","abstract":[{"lang":"eng","text":"Fault-localization is considered to be a very tedious and time-consuming activity in the design of complex Cyber-Physical Systems (CPS). This laborious task essentially requires expert knowledge of the system in order to discover the cause of the fault. In this context, we propose a new procedure that AIDS designers in debugging Simulink/Stateflow hybrid system models, guided by Signal Temporal Logic (STL) specifications. The proposed method relies on three main ingredients: (1) a monitoring and a trace diagnostics procedure that checks whether a tested behavior satisfies or violates an STL specification, localizes time segments and interfaces variables contributing to the property violations; (2) a slicing procedure that maps these observable behavior segments to the internal states and transitions of the Simulink model; and (3) a spectrum-based fault-localization method that combines the previous analysis from multiple tests to identify the internal states and/or transitions that are the most likely to explain the fault. We demonstrate the applicability of our approach on two Simulink models from the automotive and the avionics domain."}],"year":"2018","citation":{"mla":"Bartocci, Ezio, et al. <i>Localizing Faults in Simulink/Stateflow Models with STL</i>. Association for Computing Machinery, Inc, 2018, pp. 197–206, doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>.","short":"E. Bartocci, T. Ferrere, N. Manjunath, D. Nickovic, in:, Association for Computing Machinery, Inc, 2018, pp. 197–206.","ista":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. 2018. Localizing faults in simulink/stateflow models with STL. HSCC: Hybrid Systems: Computation and Control, HSCC Proceedings, , 197–206.","apa":"Bartocci, E., Ferrere, T., Manjunath, N., &#38; Nickovic, D. (2018). Localizing faults in simulink/stateflow models with STL (pp. 197–206). Presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal: Association for Computing Machinery, Inc. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>","ama":"Bartocci E, Ferrere T, Manjunath N, Nickovic D. Localizing faults in simulink/stateflow models with STL. In: Association for Computing Machinery, Inc; 2018:197-206. doi:<a href=\"https://doi.org/10.1145/3178126.3178131\">10.1145/3178126.3178131</a>","ieee":"E. Bartocci, T. Ferrere, N. Manjunath, and D. Nickovic, “Localizing faults in simulink/stateflow models with STL,” presented at the HSCC: Hybrid Systems: Computation and Control, Porto, Portugal, 2018, pp. 197–206.","chicago":"Bartocci, Ezio, Thomas Ferrere, Niveditha Manjunath, and Dejan Nickovic. “Localizing Faults in Simulink/Stateflow Models with STL,” 197–206. Association for Computing Machinery, Inc, 2018. <a href=\"https://doi.org/10.1145/3178126.3178131\">https://doi.org/10.1145/3178126.3178131</a>."},"date_updated":"2023-09-13T08:48:46Z","external_id":{"isi":["000474781600022"]},"isi":1,"conference":{"name":"HSCC: Hybrid Systems: Computation and Control","start_date":"2018-04-11","end_date":"2018-04-13","location":"Porto, Portugal"},"language":[{"iso":"eng"}],"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa_version":"None","month":"04","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","publist_id":"7738","type":"conference","date_published":"2018-04-11T00:00:00Z"},{"language":[{"iso":"eng"}],"conference":{"name":"IJCAI: International Joint Conference on Artificial Intelligence","start_date":"2018-07-13","location":"Stockholm, Sweden","end_date":"2018-07-19"},"month":"07","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1804.10601","open_access":"1"}],"type":"conference","date_published":"2018-07-01T00:00:00Z","oa":1,"publist_id":"8031","ec_funded":1,"quality_controlled":"1","page":"4692 - 4699","publisher":"IJCAI","author":[{"first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Elgyütt, Adrian","last_name":"Elgyütt","first_name":"Adrian","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Novotny, Petr","last_name":"Novotny","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Owen","last_name":"Rouillé","full_name":"Rouillé, Owen"}],"scopus_import":"1","_id":"24","intvolume":"      2018","title":"Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives","article_processing_charge":"No","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"date_created":"2018-12-11T11:44:13Z","publication_status":"published","volume":2018,"acknowledgement":"This research was supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003; Austrian Science Fund (FWF): S11407-N23(RiSE/SHiNE);and an ERC Start Grant (279307:Graph Games).\r\n","external_id":{"isi":["000764175404117"],"arxiv":["1804.10601"]},"isi":1,"citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives</i>. Vol. 2018, IJCAI, 2018, pp. 4692–99, doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>.","short":"K. Chatterjee, A. Elgyütt, P. Novotný, O. Rouillé, in:, IJCAI, 2018, pp. 4692–4699.","ista":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. 2018. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. IJCAI: International Joint Conference on Artificial Intelligence vol. 2018, 4692–4699.","apa":"Chatterjee, K., Elgyütt, A., Novotný, P., &#38; Rouillé, O. (2018). Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives (Vol. 2018, pp. 4692–4699). Presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden: IJCAI. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>","ama":"Chatterjee K, Elgyütt A, Novotný P, Rouillé O. Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives. In: Vol 2018. IJCAI; 2018:4692-4699. doi:<a href=\"https://doi.org/10.24963/ijcai.2018/652\">10.24963/ijcai.2018/652</a>","chicago":"Chatterjee, Krishnendu, Adrian Elgyütt, Petr Novotný, and Owen Rouillé. “Expectation Optimization with Probabilistic Guarantees in POMDPs with Discounted-Sum Objectives,” 2018:4692–99. IJCAI, 2018. <a href=\"https://doi.org/10.24963/ijcai.2018/652\">https://doi.org/10.24963/ijcai.2018/652</a>.","ieee":"K. Chatterjee, A. Elgyütt, P. Novotný, and O. Rouillé, “Expectation optimization with probabilistic guarantees in POMDPs with discounted-sum objectives,” presented at the IJCAI: International Joint Conference on Artificial Intelligence, Stockholm, Sweden, 2018, vol. 2018, pp. 4692–4699."},"year":"2018","date_updated":"2025-06-02T08:53:48Z","abstract":[{"text":"Partially-observable Markov decision processes (POMDPs) with discounted-sum payoff are a standard framework to model a wide range of problems related to decision making under uncertainty. Traditionally, the goal has been to obtain policies that optimize the expectation of the discounted-sum payoff. A key drawback of the expectation measure is that even low probability events with extreme payoff can significantly affect the expectation, and thus the obtained policies are not necessarily risk-averse. An alternate approach is to optimize the probability that the payoff is above a certain threshold, which allows obtaining risk-averse policies, but ignores optimization of the expectation. We consider the expectation optimization with probabilistic guarantee (EOPG) problem, where the goal is to optimize the expectation ensuring that the payoff is above a given threshold with at least a specified probability. We present several results on the EOPG problem, including the first algorithm to solve it.","lang":"eng"}],"day":"01","doi":"10.24963/ijcai.2018/652","arxiv":1},{"date_published":"2018-05-01T00:00:00Z","type":"journal_article","oa":1,"publication_identifier":{"issn":["1551-3939"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://hal.inria.fr/hal-00757488/"}],"publication":"Foundations and Trends in Electronic Design Automation","month":"05","oa_version":"Submitted Version","language":[{"iso":"eng"}],"date_updated":"2023-10-17T11:53:09Z","citation":{"ista":"Benveniste A, Nickovic D, Caillaud B, Passerone R, Raclet JB, Reinkemeier P, Sangiovanni-Vincentelli A, Damm W, Henzinger TA, Larsen KG. 2018. Contracts for system design. Foundations and Trends in Electronic Design Automation. 12(2–3), 124–400.","short":"A. Benveniste, D. Nickovic, B. Caillaud, R. Passerone, J.B. Raclet, P. Reinkemeier, A. Sangiovanni-Vincentelli, W. Damm, T.A. Henzinger, K.G. Larsen, Foundations and Trends in Electronic Design Automation 12 (2018) 124–400.","mla":"Benveniste, Albert, et al. “Contracts for System Design.” <i>Foundations and Trends in Electronic Design Automation</i>, vol. 12, no. 2–3, Now Publishers, 2018, pp. 124–400, doi:<a href=\"https://doi.org/10.1561/1000000053\">10.1561/1000000053</a>.","chicago":"Benveniste, Albert, Dejan Nickovic, Benoît Caillaud, Roberto Passerone, Jean Baptiste Raclet, Philipp Reinkemeier, Alberto Sangiovanni-Vincentelli, Werner Damm, Thomas A Henzinger, and Kim G. Larsen. “Contracts for System Design.” <i>Foundations and Trends in Electronic Design Automation</i>. Now Publishers, 2018. <a href=\"https://doi.org/10.1561/1000000053\">https://doi.org/10.1561/1000000053</a>.","ieee":"A. Benveniste <i>et al.</i>, “Contracts for system design,” <i>Foundations and Trends in Electronic Design Automation</i>, vol. 12, no. 2–3. Now Publishers, pp. 124–400, 2018.","apa":"Benveniste, A., Nickovic, D., Caillaud, B., Passerone, R., Raclet, J. B., Reinkemeier, P., … Larsen, K. G. (2018). Contracts for system design. <i>Foundations and Trends in Electronic Design Automation</i>. Now Publishers. <a href=\"https://doi.org/10.1561/1000000053\">https://doi.org/10.1561/1000000053</a>","ama":"Benveniste A, Nickovic D, Caillaud B, et al. Contracts for system design. <i>Foundations and Trends in Electronic Design Automation</i>. 2018;12(2-3):124-400. doi:<a href=\"https://doi.org/10.1561/1000000053\">10.1561/1000000053</a>"},"year":"2018","abstract":[{"lang":"eng","text":"Recently, contract-based design has been proposed as an “orthogonal” approach that complements system design methodologies proposed so far to cope with the complexity of system design. Contract-based design provides a rigorous scaffolding for verification, analysis, abstraction/refinement, and even synthesis. A number of results have been obtained in this domain but a unified treatment of the topic that can help put contract-based design in perspective was missing. This monograph intends to provide such a treatment where contracts are precisely defined and characterized so that they can be used in design methodologies with no ambiguity. In particular, this monograph identifies the essence of complex system design using contracts through a mathematical “meta-theory”, where all the properties of the methodology are derived from a very abstract and generic notion of contract. We show that the meta-theory provides deep and illuminating links with existing contract and interface theories, as well as guidelines for designing new theories. Our study encompasses contracts for both software and systems, with emphasis on the latter. We illustrate the use of contracts with two examples: requirement engineering for a parking garage management, and the development of contracts for timing and scheduling in the context of the Autosar methodology in use in the automotive sector."}],"doi":"10.1561/1000000053","day":"01","volume":12,"author":[{"full_name":"Benveniste, Albert","first_name":"Albert","last_name":"Benveniste"},{"full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"first_name":"Benoît","last_name":"Caillaud","full_name":"Caillaud, Benoît"},{"full_name":"Passerone, Roberto","first_name":"Roberto","last_name":"Passerone"},{"first_name":"Jean Baptiste","last_name":"Raclet","full_name":"Raclet, Jean Baptiste"},{"first_name":"Philipp","last_name":"Reinkemeier","full_name":"Reinkemeier, Philipp"},{"full_name":"Sangiovanni-Vincentelli, Alberto","first_name":"Alberto","last_name":"Sangiovanni-Vincentelli"},{"first_name":"Werner","last_name":"Damm","full_name":"Damm, Werner"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"full_name":"Larsen, Kim G.","first_name":"Kim G.","last_name":"Larsen"}],"issue":"2-3","_id":"5677","scopus_import":"1","title":"Contracts for system design","intvolume":"        12","publication_status":"published","date_created":"2018-12-16T22:59:19Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","page":"124-400","quality_controlled":"1","article_type":"original","publisher":"Now Publishers"},{"language":[{"iso":"eng"}],"conference":{"start_date":"2018-12-15","name":"14th International Conference on Web and Internet Economics, WINE","end_date":"2018-12-17","location":"Oxford, UK"},"month":"11","project":[{"name":"The Wittgenstein Prize","grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory","_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Preprint","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","main_file_link":[{"url":"https://arxiv.org/abs/1804.04372","open_access":"1"}],"type":"conference","date_published":"2018-11-21T00:00:00Z","oa":1,"publication_identifier":{"issn":["03029743"],"isbn":["9783030046118"]},"quality_controlled":"1","page":"21-36","publisher":"Springer","author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"id":"3B699956-F248-11E8-B48F-1D18A9856A87","full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","last_name":"Ibsen-Jensen","first_name":"Rasmus"}],"scopus_import":"1","_id":"5788","intvolume":"     11316","title":"Infinite-duration poorman-bidding games","alternative_title":["LNCS"],"date_created":"2018-12-30T22:59:14Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","volume":11316,"external_id":{"arxiv":["1804.04372"],"isi":["000865933000002"]},"isi":1,"citation":{"ieee":"G. Avni, T. A. Henzinger, and R. Ibsen-Jensen, “Infinite-duration poorman-bidding games,” presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK, 2018, vol. 11316, pp. 21–36.","chicago":"Avni, Guy, Thomas A Henzinger, and Rasmus Ibsen-Jensen. “Infinite-Duration Poorman-Bidding Games,” 11316:21–36. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>.","ama":"Avni G, Henzinger TA, Ibsen-Jensen R. Infinite-duration poorman-bidding games. In: Vol 11316. Springer; 2018:21-36. doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>","apa":"Avni, G., Henzinger, T. A., &#38; Ibsen-Jensen, R. (2018). Infinite-duration poorman-bidding games (Vol. 11316, pp. 21–36). Presented at the 14th International Conference on Web and Internet Economics, WINE, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">https://doi.org/10.1007/978-3-030-04612-5_2</a>","ista":"Avni G, Henzinger TA, Ibsen-Jensen R. 2018. Infinite-duration poorman-bidding games. 14th International Conference on Web and Internet Economics, WINE, LNCS, vol. 11316, 21–36.","short":"G. Avni, T.A. Henzinger, R. Ibsen-Jensen, in:, Springer, 2018, pp. 21–36.","mla":"Avni, Guy, et al. <i>Infinite-Duration Poorman-Bidding Games</i>. Vol. 11316, Springer, 2018, pp. 21–36, doi:<a href=\"https://doi.org/10.1007/978-3-030-04612-5_2\">10.1007/978-3-030-04612-5_2</a>."},"year":"2018","date_updated":"2023-09-12T07:44:01Z","abstract":[{"lang":"eng","text":"In two-player games on graphs, the players move a token through a graph to produce an infinite path, which determines the winner or payoff of the game. Such games are central in formal verification since they model the interaction between a non-terminating system and its environment. We study bidding games in which the players bid for the right to move the token. Two bidding rules have been defined. In Richman bidding, in each round, the players simultaneously submit bids, and the higher bidder moves the token and pays the other player. Poorman bidding is similar except that the winner of the bidding pays the “bank” rather than the other player. While poorman reachability games have been studied before, we present, for the first time, results on infinite-duration poorman games. A central quantity in these games is the ratio between the two players’ initial budgets. The questions we study concern a necessary and sufficient ratio with which a player can achieve a goal. For reachability objectives, such threshold ratios are known to exist for both bidding rules. We show that the properties of poorman reachability games extend to complex qualitative objectives such as parity, similarly to the Richman case. Our most interesting results concern quantitative poorman games, namely poorman mean-payoff games, where we construct optimal strategies depending on the initial ratio, by showing a connection with random-turn based games. The connection in itself is interesting, because it does not hold for reachability poorman games. We also solve the complexity problems that arise in poorman bidding games."}],"day":"21","arxiv":1,"doi":"10.1007/978-3-030-04612-5_2"},{"ddc":["000"],"year":"2018","citation":{"mla":"Bakhirkin, Alexey, et al. “Keynote: The First-Order Logic of Signals.” <i>2018 International Conference on Embedded Software</i>, IEEE, 2018, pp. 1–10, doi:<a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">10.1109/emsoft.2018.8537203</a>.","short":"A. Bakhirkin, T. Ferrere, T.A. Henzinger, D. Nickovicl, in:, 2018 International Conference on Embedded Software, IEEE, 2018, pp. 1–10.","ista":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. 2018. Keynote: The first-order logic of signals. 2018 International Conference on Embedded Software. EMSOFT: International Conference on Embedded Software, 1–10.","apa":"Bakhirkin, A., Ferrere, T., Henzinger, T. A., &#38; Nickovicl, D. (2018). Keynote: The first-order logic of signals. In <i>2018 International Conference on Embedded Software</i> (pp. 1–10). Turin, Italy: IEEE. <a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">https://doi.org/10.1109/emsoft.2018.8537203</a>","ama":"Bakhirkin A, Ferrere T, Henzinger TA, Nickovicl D. Keynote: The first-order logic of signals. In: <i>2018 International Conference on Embedded Software</i>. IEEE; 2018:1-10. doi:<a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">10.1109/emsoft.2018.8537203</a>","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Thomas A Henzinger, and Deian Nickovicl. “Keynote: The First-Order Logic of Signals.” In <i>2018 International Conference on Embedded Software</i>, 1–10. IEEE, 2018. <a href=\"https://doi.org/10.1109/emsoft.2018.8537203\">https://doi.org/10.1109/emsoft.2018.8537203</a>.","ieee":"A. Bakhirkin, T. Ferrere, T. A. Henzinger, and D. Nickovicl, “Keynote: The first-order logic of signals,” in <i>2018 International Conference on Embedded Software</i>, Turin, Italy, 2018, pp. 1–10."},"date_updated":"2023-09-19T10:41:29Z","external_id":{"isi":["000492828500005"]},"isi":1,"day":"30","doi":"10.1109/emsoft.2018.8537203","abstract":[{"text":"Formalizing properties of systems with continuous dynamics is a challenging task. In this paper, we propose a formal framework for specifying and monitoring rich temporal properties of real-valued signals. We introduce signal first-order logic (SFO) as a specification language that combines first-order logic with linear-real arithmetic and unary function symbols interpreted as piecewise-linear signals. We first show that while the satisfiability problem for SFO is undecidable, its membership and monitoring problems are decidable. We develop an offline monitoring procedure for SFO that has polynomial complexity in the size of the input trace and the specification, for a fixed number of quantifiers and function symbols. We show that the algorithm has computation time linear in the size of the input trace for the important fragment of bounded-response specifications interpreted over input traces with finite variability. We can use our results to extend signal temporal logic with first-order quantifiers over time and value parameters, while preserving its efficient monitoring. We finally demonstrate the practical appeal of our logic through a case study in the micro-electronics domain.","lang":"eng"}],"quality_controlled":"1","page":"1-10","file_date_updated":"2020-07-14T12:47:13Z","publisher":"IEEE","scopus_import":"1","_id":"5959","author":[{"full_name":"Bakhirkin, Alexey","last_name":"Bakhirkin","first_name":"Alexey"},{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Nickovicl","first_name":"Deian","full_name":"Nickovicl, Deian"}],"date_created":"2019-02-13T09:19:28Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","title":"Keynote: The first-order logic of signals","file":[{"checksum":"234a33ad9055b3458fcdda6af251b33a","file_size":338006,"date_created":"2020-05-14T16:01:29Z","file_name":"2018_EMSOFT_Bakhirkin.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:47:13Z","relation":"main_file","access_level":"open_access","creator":"dernst","file_id":"7839"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","type":"conference","date_published":"2018-09-30T00:00:00Z","publication_identifier":{"isbn":["9781538655603"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2018-09-30","name":"EMSOFT: International Conference on Embedded Software","end_date":"2018-10-05","location":"Turin, Italy"},"has_accepted_license":"1","publication":"2018 International Conference on Embedded Software","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211","name":"The Wittgenstein Prize"}],"oa_version":"Published Version","month":"09"},{"language":[{"iso":"eng"}],"series_title":"Handbook of Model Checking","quality_controlled":"1","page":"1 - 26","editor":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"publisher":"Springer","author":[{"last_name":"Clarke","first_name":"Edmund","full_name":"Clarke, Edmund"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"},{"first_name":"Helmut","last_name":"Veith","full_name":"Veith, Helmut"}],"scopus_import":1,"publication":"Handbook of Model Checking","_id":"60","title":"Introduction to model checking","month":"05","date_created":"2018-12-11T11:44:25Z","department":[{"_id":"ToHe"}],"oa_version":"None","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","status":"public","type":"book_chapter","date_published":"2018-05-19T00:00:00Z","year":"2018","citation":{"ama":"Clarke E, Henzinger TA, Veith H. Introduction to model checking. In: Henzinger TA, ed. <i>Handbook of Model Checking</i>. Handbook of Model Checking. Springer; 2018:1-26. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>","apa":"Clarke, E., Henzinger, T. A., &#38; Veith, H. (2018). Introduction to model checking. In T. A. Henzinger (Ed.), <i>Handbook of Model Checking</i> (pp. 1–26). Springer. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>","ieee":"E. Clarke, T. A. Henzinger, and H. Veith, “Introduction to model checking,” in <i>Handbook of Model Checking</i>, T. A. Henzinger, Ed. Springer, 2018, pp. 1–26.","chicago":"Clarke, Edmund, Thomas A Henzinger, and Helmut Veith. “Introduction to Model Checking.” In <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, 1–26. Handbook of Model Checking. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">https://doi.org/10.1007/978-3-319-10575-8_1</a>.","short":"E. Clarke, T.A. Henzinger, H. Veith, in:, T.A. Henzinger (Ed.), Handbook of Model Checking, Springer, 2018, pp. 1–26.","mla":"Clarke, Edmund, et al. “Introduction to Model Checking.” <i>Handbook of Model Checking</i>, edited by Thomas A Henzinger, Springer, 2018, pp. 1–26, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8_1\">10.1007/978-3-319-10575-8_1</a>.","ista":"Clarke E, Henzinger TA, Veith H. 2018.Introduction to model checking. In: Handbook of Model Checking. , 1–26."},"date_updated":"2021-01-12T08:05:35Z","publist_id":"7994","abstract":[{"lang":"eng","text":"Model checking is a computer-assisted method for the analysis of dynamical systems that can be modeled by state-transition systems. Drawing from research traditions in mathematical logic, programming languages, hardware design, and theoretical computer science, model checking is now widely used for the verification of hardware and software in industry. This chapter is an introduction and short survey of model checking. The chapter aims to motivate and link the individual chapters of the handbook, and to provide context for readers who are not familiar with model checking."}],"day":"19","doi":"10.1007/978-3-319-10575-8_1"},{"publication_identifier":{"issn":["1868-8969"]},"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","date_published":"2018-08-01T00:00:00Z","file":[{"content_type":"application/pdf","file_name":"2018_LIPIcs_Avni.pdf","date_updated":"2020-07-14T12:47:15Z","checksum":"41ab2ae9b63f5eb49fa995250c0ba128","file_size":542889,"date_created":"2019-02-14T14:22:04Z","creator":"dernst","file_id":"6007","relation":"main_file","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"963","relation":"earlier_version"}]},"status":"public","project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"M02369","name":"Formal Methods meets Algorithmic Game Theory"}],"oa_version":"Published Version","article_number":"23","month":"08","has_accepted_license":"1","conference":{"start_date":"2018-08-27","name":"MFCS: Mathematical Foundations of Computer Science","location":"Liverpool, United Kingdom","end_date":"2018-08-31"},"language":[{"iso":"eng"}],"day":"01","doi":"10.4230/LIPICS.MFCS.2018.23","abstract":[{"lang":"eng","text":"Network games are widely used as a model for selfish resource-allocation problems. In the classicalmodel, each player selects a path connecting her source and target vertices. The cost of traversingan edge depends on theload; namely, number of players that traverse it. Thus, it abstracts the factthat different users may use a resource at different times and for different durations, which playsan important role in determining the costs of the users in reality. For example, when transmittingpackets in a communication network, routing traffic in a road network, or processing a task in aproduction system, actual sharing and congestion of resources crucially depends on time.In [13], we introducedtimed network games, which add a time component to network games.Each vertexvin the network is associated with a cost function, mapping the load onvto theprice that a player pays for staying invfor one time unit with this load.  Each edge in thenetwork is guarded by the time intervals in which it can be traversed, which forces the players tospend time in the vertices. In this work we significantly extend the way time can be referred toin timed network games. In the model we study, the network is equipped withclocks, and, as intimed automata, edges are guarded by constraints on the values of the clocks, and their traversalmay involve a reset of some clocks. We argue that the stronger model captures many realisticnetworks.  The addition of clocks breaks the techniques we developed in [13] and we developnew techniques in order to show that positive results on classic network games carry over to thestronger timed setting."}],"citation":{"ieee":"G. Avni, S. Guha, and O. Kupferman, “Timed network games with clocks,” presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom, 2018, vol. 117.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “Timed Network Games with Clocks,” Vol. 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>.","ama":"Avni G, Guha S, Kupferman O. Timed network games with clocks. In: Vol 117. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). Timed network games with clocks (Vol. 117). Presented at the MFCS: Mathematical Foundations of Computer Science, Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">https://doi.org/10.4230/LIPICS.MFCS.2018.23</a>","ista":"Avni G, Guha S, Kupferman O. 2018. Timed network games with clocks. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 117, 23.","mla":"Avni, Guy, et al. <i>Timed Network Games with Clocks</i>. Vol. 117, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPICS.MFCS.2018.23\">10.4230/LIPICS.MFCS.2018.23</a>.","short":"G. Avni, S. Guha, O. Kupferman, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018."},"year":"2018","date_updated":"2023-02-23T14:02:58Z","volume":117,"ddc":["000"],"article_processing_charge":"No","date_created":"2019-02-14T14:12:09Z","department":[{"_id":"ToHe"}],"publication_status":"published","intvolume":"       117","title":"Timed network games with clocks","alternative_title":["LIPIcs"],"license":"https://creativecommons.org/licenses/by/4.0/","scopus_import":"1","_id":"6005","author":[{"first_name":"Guy","last_name":"Avni","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Guha, Shibashis","last_name":"Guha","first_name":"Shibashis"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","file_date_updated":"2020-07-14T12:47:15Z"},{"ddc":["004"],"volume":9,"abstract":[{"lang":"eng","text":"Network games (NGs) are played on directed graphs and are extensively used in network design and analysis. Search problems for NGs include finding special strategy profiles such as a Nash equilibrium and a globally-optimal solution. The networks modeled by NGs may be huge. In formal verification, abstraction has proven to be an extremely effective technique for reasoning about systems with big and even infinite state spaces. We describe an abstraction-refinement methodology for reasoning about NGs. Our methodology is based on an abstraction function that maps the state space of an NG to a much smaller state space. We search for a global optimum and a Nash equilibrium by reasoning on an under- and an over-approximation defined on top of this smaller state space. When the approximations are too coarse to find such profiles, we refine the abstraction function. We extend the abstraction-refinement methodology to labeled networks, where the objectives of the players are regular languages. Our experimental results demonstrate the effectiveness of the methodology. "}],"day":"01","doi":"10.3390/g9030039","year":"2018","citation":{"mla":"Avni, Guy, et al. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>, vol. 9, no. 3, 39, MDPI AG, 2018, doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>.","short":"G. Avni, S. Guha, O. Kupferman, Games 9 (2018).","ista":"Avni G, Guha S, Kupferman O. 2018. An abstraction-refinement methodology for reasoning about network games. Games. 9(3), 39.","ama":"Avni G, Guha S, Kupferman O. An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. 2018;9(3). doi:<a href=\"https://doi.org/10.3390/g9030039\">10.3390/g9030039</a>","apa":"Avni, G., Guha, S., &#38; Kupferman, O. (2018). An abstraction-refinement methodology for reasoning about network games. <i>Games</i>. MDPI AG. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>","ieee":"G. Avni, S. Guha, and O. Kupferman, “An abstraction-refinement methodology for reasoning about network games,” <i>Games</i>, vol. 9, no. 3. MDPI AG, 2018.","chicago":"Avni, Guy, Shibashis Guha, and Orna Kupferman. “An Abstraction-Refinement Methodology for Reasoning about Network Games.” <i>Games</i>. MDPI AG, 2018. <a href=\"https://doi.org/10.3390/g9030039\">https://doi.org/10.3390/g9030039</a>."},"date_updated":"2023-09-22T09:48:59Z","publisher":"MDPI AG","file_date_updated":"2020-07-14T12:47:16Z","quality_controlled":"1","intvolume":"         9","title":"An abstraction-refinement methodology for reasoning about network games","department":[{"_id":"ToHe"}],"date_created":"2019-02-14T14:17:54Z","publication_status":"published","issue":"3","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni"},{"full_name":"Guha, Shibashis","last_name":"Guha","first_name":"Shibashis"},{"full_name":"Kupferman, Orna","last_name":"Kupferman","first_name":"Orna"}],"scopus_import":1,"_id":"6006","related_material":{"record":[{"relation":"earlier_version","id":"1003","status":"public"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","file":[{"checksum":"749d65ca4ce74256a029d9644a1b1cb0","file_size":505155,"date_created":"2019-02-14T14:20:31Z","content_type":"application/pdf","file_name":"2018_MDPI_Avni.pdf","date_updated":"2020-07-14T12:47:16Z","access_level":"open_access","relation":"main_file","creator":"kschuh","file_id":"6008"}],"oa":1,"publication_identifier":{"issn":["2073-4336"]},"type":"journal_article","date_published":"2018-09-01T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"language":[{"iso":"eng"}],"article_number":"39","month":"09","project":[{"_id":"264B3912-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Formal Methods meets Algorithmic Game Theory","grant_number":"M02369"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","has_accepted_license":"1","publication":"Games"},{"article_type":"original","publisher":"Elsevier","ec_funded":1,"quality_controlled":"1","page":"50 - 72","intvolume":"       712","title":"Synthesis from component libraries with costs","department":[{"_id":"ToHe"}],"date_created":"2018-12-11T11:47:28Z","article_processing_charge":"No","publication_status":"published","author":[{"orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","first_name":"Guy","last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kupferman, Orna","first_name":"Orna","last_name":"Kupferman"}],"scopus_import":"1","_id":"608","volume":712,"abstract":[{"text":"Synthesis is the automated construction of a system from its specification. In real life, hardware and software systems are rarely constructed from scratch. Rather, a system is typically constructed from a library of components. Lustig and Vardi formalized this intuition and studied LTL synthesis from component libraries. In real life, designers seek optimal systems. In this paper we add optimality considerations to the setting. We distinguish between quality considerations (for example, size - the smaller a system is, the better it is), and pricing (for example, the payment to the company who manufactured the component). We study the problem of designing systems with minimal quality-cost and price. A key point is that while the quality cost is individual - the choices of a designer are independent of choices made by other designers that use the same library, pricing gives rise to a resource-allocation game - designers that use the same component share its price, with the share being proportional to the number of uses (a component can be used several times in a design). We study both closed and open settings, and in both we solve the problem of finding an optimal design. In a setting with multiple designers, we also study the game-theoretic problems of the induced resource-allocation game.","lang":"eng"}],"day":"15","doi":"10.1016/j.tcs.2017.11.001","external_id":{"isi":["000424959200003"]},"isi":1,"year":"2018","citation":{"chicago":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>.","ieee":"G. Avni and O. Kupferman, “Synthesis from component libraries with costs,” <i>Theoretical Computer Science</i>, vol. 712. Elsevier, pp. 50–72, 2018.","ama":"Avni G, Kupferman O. Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. 2018;712:50-72. doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>","apa":"Avni, G., &#38; Kupferman, O. (2018). Synthesis from component libraries with costs. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">https://doi.org/10.1016/j.tcs.2017.11.001</a>","ista":"Avni G, Kupferman O. 2018. Synthesis from component libraries with costs. Theoretical Computer Science. 712, 50–72.","short":"G. Avni, O. Kupferman, Theoretical Computer Science 712 (2018) 50–72.","mla":"Avni, Guy, and Orna Kupferman. “Synthesis from Component Libraries with Costs.” <i>Theoretical Computer Science</i>, vol. 712, Elsevier, 2018, pp. 50–72, doi:<a href=\"https://doi.org/10.1016/j.tcs.2017.11.001\">10.1016/j.tcs.2017.11.001</a>."},"date_updated":"2023-09-19T10:00:21Z","language":[{"iso":"eng"}],"month":"02","project":[{"grant_number":"267989","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"}],"oa_version":"Published Version","publication":"Theoretical Computer Science","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","main_file_link":[{"open_access":"1","url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.636.4529"}],"oa":1,"publist_id":"7197","type":"journal_article","date_published":"2018-02-15T00:00:00Z"},{"title":"A theory of register monitors","alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"month":"07","date_created":"2018-12-11T11:44:52Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"oa_version":"None","publication_status":"published","author":[{"full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Saraç","first_name":"Ege","full_name":"Saraç, Ege"}],"scopus_import":"1","_id":"144","conference":{"name":"LICS: Logic in Computer Science","start_date":"2018-07-09","location":"Oxford, UK","end_date":"2018-07-12"},"publisher":"IEEE","language":[{"iso":"eng"}],"quality_controlled":"1","page":"394 - 403","publist_id":"7779","abstract":[{"text":"The task of a monitor is to watch, at run-time, the execution of a reactive system, and signal the occurrence of a safety violation in the observed sequence of events. While finite-state monitors have been studied extensively, in practice, monitoring software also makes use of unbounded memory. We define a model of automata equipped with integer-valued registers which can execute only a bounded number of instructions between consecutive events, and thus can form the theoretical basis for the study of infinite-state monitors. We classify these register monitors according to the number k of available registers, and the type of register instructions. In stark contrast to the theory of computability for register machines, we prove that for every k 1, monitors with k + 1 counters (with instruction set 〈+1, =〉) are strictly more expressive than monitors with k counters. We also show that adder monitors (with instruction set 〈1, +, =〉) are strictly more expressive than counter monitors, but are complete for monitoring all computable safety -languages for k = 6. Real-time monitors are further required to signal the occurrence of a safety violation as soon as it occurs. The expressiveness hierarchy for counter monitors carries over to real-time monitors. We then show that 2 adders cannot simulate 3 counters in real-time. Finally, we show that real-time adder monitors with inequalities are as expressive as real-time Turing machines.","lang":"eng"}],"day":"09","doi":"10.1145/3209108.3209194","external_id":{"isi":["000545262800041"]},"type":"conference","date_published":"2018-07-09T00:00:00Z","isi":1,"year":"2018","citation":{"ista":"Ferrere T, Henzinger TA, Saraç E. 2018. A theory of register monitors. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. Part F138033, 394–403.","short":"T. Ferrere, T.A. Henzinger, E. Saraç, in:, IEEE, 2018, pp. 394–403.","mla":"Ferrere, Thomas, et al. <i>A Theory of Register Monitors</i>. Vol. Part F138033, IEEE, 2018, pp. 394–403, doi:<a href=\"https://doi.org/10.1145/3209108.3209194\">10.1145/3209108.3209194</a>.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Ege Saraç. “A Theory of Register Monitors,” Part F138033:394–403. IEEE, 2018. <a href=\"https://doi.org/10.1145/3209108.3209194\">https://doi.org/10.1145/3209108.3209194</a>.","ieee":"T. Ferrere, T. A. Henzinger, and E. Saraç, “A theory of register monitors,” presented at the LICS: Logic in Computer Science, Oxford, UK, 2018, vol. Part F138033, pp. 394–403.","ama":"Ferrere T, Henzinger TA, Saraç E. A theory of register monitors. In: Vol Part F138033. IEEE; 2018:394-403. doi:<a href=\"https://doi.org/10.1145/3209108.3209194\">10.1145/3209108.3209194</a>","apa":"Ferrere, T., Henzinger, T. A., &#38; Saraç, E. (2018). A theory of register monitors (Vol. Part F138033, pp. 394–403). Presented at the LICS: Logic in Computer Science, Oxford, UK: IEEE. <a href=\"https://doi.org/10.1145/3209108.3209194\">https://doi.org/10.1145/3209108.3209194</a>"},"date_updated":"2023-09-08T11:49:13Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","volume":"Part F138033"},{"conference":{"end_date":"2018-07-17","location":"Oxford, UK","name":"FM: International Symposium on Formal Methods","start_date":"2018-07-15"},"language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","month":"07","has_accepted_license":"1","file":[{"creator":"dernst","file_id":"8637","access_level":"open_access","relation":"main_file","success":1,"file_name":"2018_LNCS_Ferrere.pdf","content_type":"application/pdf","date_updated":"2020-10-09T06:22:41Z","file_size":485576,"checksum":"a045c213c42c445f1889326f8db82a0a","date_created":"2020-10-09T06:22:41Z"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","oa":1,"publist_id":"7765","type":"conference","date_published":"2018-07-12T00:00:00Z","publisher":"Springer","quality_controlled":"1","page":"147 - 164","file_date_updated":"2020-10-09T06:22:41Z","date_created":"2018-12-11T11:44:55Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","intvolume":"     10951","alternative_title":["LNCS"],"title":"The compound interest in relaxing punctuality","scopus_import":"1","_id":"156","author":[{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143","full_name":"Ferrere, Thomas"}],"volume":10951,"ddc":["000"],"day":"12","doi":"10.1007/978-3-319-95582-7_9","abstract":[{"text":"Imprecision in timing can sometimes be beneficial: Metric interval temporal logic (MITL), disabling the expression of punctuality constraints, was shown to translate to timed automata, yielding an elementary decision procedure. We show how this principle extends to other forms of dense-time specification using regular expressions. By providing a clean, automaton-based formal framework for non-punctual languages, we are able to recover and extend several results in timed systems. Metric interval regular expressions (MIRE) are introduced, providing regular expressions with non-singular duration constraints. We obtain that MIRE are expressively complete relative to a class of one-clock timed automata, which can be determinized using additional clocks. Metric interval dynamic logic (MIDL) is then defined using MIRE as temporal modalities. We show that MIDL generalizes known extensions of MITL, while translating to timed automata at comparable cost.","lang":"eng"}],"citation":{"ieee":"T. Ferrere, “The compound interest in relaxing punctuality,” presented at the FM: International Symposium on Formal Methods, Oxford, UK, 2018, vol. 10951, pp. 147–164.","chicago":"Ferrere, Thomas. “The Compound Interest in Relaxing Punctuality,” 10951:147–64. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>.","apa":"Ferrere, T. (2018). The compound interest in relaxing punctuality (Vol. 10951, pp. 147–164). Presented at the FM: International Symposium on Formal Methods, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">https://doi.org/10.1007/978-3-319-95582-7_9</a>","ama":"Ferrere T. The compound interest in relaxing punctuality. In: Vol 10951. Springer; 2018:147-164. doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>","ista":"Ferrere T. 2018. The compound interest in relaxing punctuality. FM: International Symposium on Formal Methods, LNCS, vol. 10951, 147–164.","short":"T. Ferrere, in:, Springer, 2018, pp. 147–164.","mla":"Ferrere, Thomas. <i>The Compound Interest in Relaxing Punctuality</i>. Vol. 10951, Springer, 2018, pp. 147–64, doi:<a href=\"https://doi.org/10.1007/978-3-319-95582-7_9\">10.1007/978-3-319-95582-7_9</a>."},"year":"2018","date_updated":"2023-09-19T10:05:37Z","external_id":{"isi":["000489765800009"]},"isi":1},{"publisher":"Springer","file_date_updated":"2020-07-14T12:45:04Z","quality_controlled":"1","page":"79 - 102","intvolume":"     10981","title":"Layered Concurrent Programs","alternative_title":["LNCS"],"date_created":"2018-12-11T11:44:57Z","department":[{"_id":"ToHe"}],"article_processing_charge":"No","publication_status":"published","author":[{"first_name":"Bernhard","last_name":"Kragl","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard","id":"320FC952-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Shaz","last_name":"Qadeer","full_name":"Qadeer, Shaz"}],"scopus_import":"1","_id":"160","ddc":["000"],"volume":10981,"abstract":[{"text":"We present layered concurrent programs, a compact and expressive notation for specifying refinement proofs of concurrent programs. A layered concurrent program specifies a sequence of connected concurrent programs, from most concrete to most abstract, such that common parts of different programs are written exactly once. These programs are expressed in the ordinary syntax of imperative concurrent programs using gated atomic actions, sequencing, choice, and (recursive) procedure calls. Each concurrent program is automatically extracted from the layered program. We reduce refinement to the safety of a sequence of concurrent checker programs, one each to justify the connection between every two consecutive concurrent programs. These checker programs are also automatically extracted from the layered program. Layered concurrent programs have been implemented in the CIVL verifier which has been successfully used for the verification of several complex concurrent programs.","lang":"eng"}],"day":"18","doi":"10.1007/978-3-319-96145-3_5","external_id":{"isi":["000491481600005"]},"isi":1,"year":"2018","citation":{"ieee":"B. Kragl and S. Qadeer, “Layered Concurrent Programs,” presented at the CAV: Computer Aided Verification, Oxford, UK, 2018, vol. 10981, pp. 79–102.","chicago":"Kragl, Bernhard, and Shaz Qadeer. “Layered Concurrent Programs,” 10981:79–102. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>.","apa":"Kragl, B., &#38; Qadeer, S. (2018). Layered Concurrent Programs (Vol. 10981, pp. 79–102). Presented at the CAV: Computer Aided Verification, Oxford, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">https://doi.org/10.1007/978-3-319-96145-3_5</a>","ama":"Kragl B, Qadeer S. Layered Concurrent Programs. In: Vol 10981. Springer; 2018:79-102. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>","ista":"Kragl B, Qadeer S. 2018. Layered Concurrent Programs. CAV: Computer Aided Verification, LNCS, vol. 10981, 79–102.","short":"B. Kragl, S. Qadeer, in:, Springer, 2018, pp. 79–102.","mla":"Kragl, Bernhard, and Shaz Qadeer. <i>Layered Concurrent Programs</i>. Vol. 10981, Springer, 2018, pp. 79–102, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_5\">10.1007/978-3-319-96145-3_5</a>."},"date_updated":"2023-09-13T08:45:09Z","conference":{"name":"CAV: Computer Aided Verification","start_date":"2018-07-14","location":"Oxford, UK","end_date":"2018-07-17"},"language":[{"iso":"eng"}],"month":"07","project":[{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","grant_number":"Z211"},{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"}],"oa_version":"Published Version","has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","related_material":{"record":[{"status":"public","id":"8332","relation":"dissertation_contains"}]},"status":"public","file":[{"file_name":"2018_LNCS_Kragl.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:04Z","file_size":1603844,"checksum":"c64fff560fe5a7532ec10626ad1c215e","date_created":"2018-12-17T12:52:12Z","creator":"dernst","file_id":"5705","access_level":"open_access","relation":"main_file"}],"publist_id":"7761","oa":1,"type":"conference","date_published":"2018-07-18T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"file":[{"date_updated":"2020-07-14T12:44:44Z","content_type":"application/pdf","file_name":"IST-2018-853-v2+2_concur2018.pdf","date_created":"2018-12-12T10:18:46Z","checksum":"c90895f4c5fafc18ddc54d1c8848077e","file_size":745438,"file_id":"5368","creator":"system","access_level":"open_access","relation":"main_file"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","related_material":{"record":[{"status":"public","id":"6426","relation":"earlier_version"},{"id":"8332","relation":"dissertation_contains","status":"public"}]},"publication_identifier":{"issn":["18688969"]},"publist_id":"7790","oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"type":"conference","date_published":"2018-08-13T00:00:00Z","conference":{"name":"CONCUR: International Conference on Concurrency Theory","start_date":"2018-09-04","location":"Beijing, China","end_date":"2018-09-07"},"language":[{"iso":"eng"}],"project":[{"call_identifier":"FWF","_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S11402-N23"},{"grant_number":"S11402-N23","name":"Moderne Concurrency Paradigms","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Published Version","article_number":"21","month":"08","has_accepted_license":"1","volume":118,"ddc":["000"],"day":"13","doi":"10.4230/LIPIcs.CONCUR.2018.21","abstract":[{"text":"Synchronous programs are easy to specify because the side effects of an operation are finished by the time the invocation of the operation returns to the caller. Asynchronous programs, on the other hand, are difficult to specify because there are side effects due to pending computation scheduled as a result of the invocation of an operation. They are also difficult to verify because of the large number of possible interleavings of concurrent computation threads. We present synchronization, a new proof rule that simplifies the verification of asynchronous programs by introducing the fiction, for proof purposes, that asynchronous operations complete synchronously. Synchronization summarizes an asynchronous computation as immediate atomic effect. Modular verification is enabled via pending asynchronous calls in atomic summaries, and a complementary proof rule that eliminates pending asynchronous calls when components and their specifications are composed. We evaluate synchronization in the context of a multi-layer refinement verification methodology on a collection of benchmark programs.","lang":"eng"}],"citation":{"apa":"Kragl, B., Qadeer, S., &#38; Henzinger, T. A. (2018). Synchronizing the asynchronous (Vol. 118). Presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.21</a>","ama":"Kragl B, Qadeer S, Henzinger TA. Synchronizing the asynchronous. In: Vol 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2018. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">10.4230/LIPIcs.CONCUR.2018.21</a>","ieee":"B. Kragl, S. Qadeer, and T. A. Henzinger, “Synchronizing the asynchronous,” presented at the CONCUR: International Conference on Concurrency Theory, Beijing, China, 2018, vol. 118.","chicago":"Kragl, Bernhard, Shaz Qadeer, and Thomas A Henzinger. “Synchronizing the Asynchronous,” Vol. 118. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">https://doi.org/10.4230/LIPIcs.CONCUR.2018.21</a>.","short":"B. Kragl, S. Qadeer, T.A. Henzinger, in:, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018.","mla":"Kragl, Bernhard, et al. <i>Synchronizing the Asynchronous</i>. Vol. 118, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2018, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2018.21\">10.4230/LIPIcs.CONCUR.2018.21</a>.","ista":"Kragl B, Qadeer S, Henzinger TA. 2018. Synchronizing the asynchronous. CONCUR: International Conference on Concurrency Theory, LIPIcs, vol. 118, 21."},"year":"2018","date_updated":"2023-09-07T13:18:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","file_date_updated":"2020-07-14T12:44:44Z","date_created":"2018-12-11T11:44:48Z","department":[{"_id":"ToHe"}],"publication_status":"published","intvolume":"       118","title":"Synchronizing the asynchronous","pubrep_id":"1039","alternative_title":["LIPIcs"],"scopus_import":1,"_id":"133","author":[{"id":"320FC952-F248-11E8-B48F-1D18A9856A87","first_name":"Bernhard","last_name":"Kragl","orcid":"0000-0001-7745-9117","full_name":"Kragl, Bernhard"},{"last_name":"Qadeer","first_name":"Shaz","full_name":"Qadeer, Shaz"},{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}]},{"date_published":"2018-07-18T00:00:00Z","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publist_id":"7783","oa":1,"publication_identifier":{"issn":["03029743"]},"status":"public","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6894"}]},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_size":563710,"checksum":"6dca832f575d6b3f0ea9dff56f579142","date_created":"2018-12-12T10:17:53Z","file_name":"IST-2018-1010-v1+1_space-time_interpolants.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:50Z","access_level":"open_access","relation":"main_file","creator":"system","file_id":"5310"}],"has_accepted_license":"1","month":"07","oa_version":"Published Version","project":[{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"language":[{"iso":"eng"}],"conference":{"name":"CAV: Computer Aided Verification","start_date":"2018-07-14","end_date":"2018-07-17","location":"Oxford, United Kingdom"},"isi":1,"external_id":{"isi":["000491481600025"]},"date_updated":"2023-09-19T09:30:43Z","citation":{"ieee":"G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.","chicago":"Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,” 10981:468–86. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>.","apa":"Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>","ama":"Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981. Springer; 2018:468-486. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>","ista":"Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.","mla":"Frehse, Goran, et al. <i>Space-Time Interpolants</i>. Vol. 10981, Springer, 2018, pp. 468–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>.","short":"G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486."},"year":"2018","abstract":[{"lang":"eng","text":"Reachability analysis is difficult for hybrid automata with affine differential equations, because the reach set needs to be approximated. Promising abstraction techniques usually employ interval methods or template polyhedra. Interval methods account for dense time and guarantee soundness, and there are interval-based tools that overapproximate affine flowpipes. But interval methods impose bounded and rigid shapes, which make refinement expensive and fixpoint detection difficult. Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded, but sound template refinement for unbounded reachability analysis has been implemented only for systems with piecewise constant dynamics. We capitalize on the advantages of both techniques, combining interval arithmetic and template polyhedra, using the former to abstract time and the latter to abstract space. During a CEGAR loop, whenever a spurious error trajectory is found, we compute additional space constraints and split time intervals, and use these space-time interpolants to eliminate the counterexample. Space-time interpolation offers a lazy, flexible framework for increasing precision while guaranteeing soundness, both for error avoidance and fixpoint detection. To the best of out knowledge, this is the first abstraction refinement scheme for the reachability analysis over unbounded and dense time of affine hybrid systems, which is both sound and automatic. We demonstrate the effectiveness of our algorithm with several benchmark examples, which cannot be handled by other tools."}],"doi":"10.1007/978-3-319-96145-3_25","day":"18","ddc":["005"],"volume":10981,"author":[{"full_name":"Frehse, Goran","last_name":"Frehse","first_name":"Goran"},{"orcid":"0000-0001-8180-0904","full_name":"Giacobbe, Mirco","first_name":"Mirco","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"_id":"140","scopus_import":"1","title":"Space-time interpolants","alternative_title":["LNCS"],"pubrep_id":"1010","intvolume":"     10981","publication_status":"published","article_processing_charge":"No","date_created":"2018-12-11T11:44:50Z","department":[{"_id":"ToHe"}],"file_date_updated":"2020-07-14T12:44:50Z","page":"468 - 486","quality_controlled":"1","publisher":"Springer"},{"month":"07","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23"},{"name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Published Version","has_accepted_license":"1","conference":{"end_date":"2018-07-17","location":"Oxford, United Kingdom","name":"CAV: Computer Aided Verification","start_date":"2018-07-14"},"language":[{"iso":"eng"}],"publist_id":"7781","oa":1,"type":"conference","date_published":"2018-07-18T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"file_name":"2018_LNCS_Kong.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:44:53Z","file_size":5591566,"checksum":"fd95e8026deacef3dc752a733bb9355f","date_created":"2018-12-17T15:57:06Z","creator":"dernst","file_id":"5718","access_level":"open_access","relation":"main_file"}],"intvolume":"     10981","alternative_title":["LNCS"],"title":"Reachable set over-approximation for nonlinear systems using piecewise barrier tubes","date_created":"2018-12-11T11:44:51Z","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publication_status":"published","author":[{"first_name":"Hui","last_name":"Kong","orcid":"0000-0002-3066-6941","full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"scopus_import":"1","_id":"142","publisher":"Springer","file_date_updated":"2020-07-14T12:44:53Z","quality_controlled":"1","page":"449 - 467","abstract":[{"text":"We address the problem of analyzing the reachable set of a polynomial nonlinear continuous system by over-approximating the flowpipe of its dynamics. The common approach to tackle this problem is to perform a numerical integration over a given time horizon based on Taylor expansion and interval arithmetic. However, this method results to be very conservative when there is a large difference in speed between trajectories as time progresses. In this paper, we propose to use combinations of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse box which is big enough to contain the segment is constructed using sampled simulation and then in the box we compute by linear programming a set of barrier functions (called barrier tube or BT for short) which work together to form a tube surrounding the flowpipe. The benefit of using PBT is that (1) BT is independent of time and hence can avoid being stretched and deformed by time; and (2) a small number of BTs can form a tight over-approximation for the flowpipe, which means that the computation required to decide whether the BTs intersect the unsafe set can be reduced significantly. We implemented a prototype called PBTS in C++. Experiments on some benchmark systems show that our approach is effective.","lang":"eng"}],"day":"18","doi":"10.1007/978-3-319-96145-3_24","external_id":{"isi":["000491481600024"]},"isi":1,"citation":{"ista":"Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification, LNCS, vol. 10981, 449–467.","mla":"Kong, Hui, et al. <i>Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes</i>. Vol. 10981, Springer, 2018, pp. 449–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>.","short":"H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.","ieee":"H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.","chicago":"Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>.","ama":"Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>","apa":"Kong, H., Bartocci, E., &#38; Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>"},"year":"2018","date_updated":"2023-09-15T12:12:08Z","ddc":["000"],"acknowledgement":"Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32","volume":10981}]