{"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"8287"}]},"quality_controlled":"1","title":"Reachability analysis of linear hybrid systems via block decomposition","main_file_link":[{"url":"https://arxiv.org/abs/1905.02458","open_access":"1"}],"project":[{"name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"intvolume":"        39","date_published":"2020-11-01T00:00:00Z","citation":{"short":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, C. Schilling, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 39 (2020) 4018–4029.","mla":"Bogomolov, Sergiy, et al. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, vol. 39, no. 11, IEEE, 2020, pp. 4018–29, doi:<a href=\"https://doi.org/10.1109/TCAD.2020.3012859\">10.1109/TCAD.2020.3012859</a>.","ama":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. Reachability analysis of linear hybrid systems via block decomposition. <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>. 2020;39(11):4018-4029. doi:<a href=\"https://doi.org/10.1109/TCAD.2020.3012859\">10.1109/TCAD.2020.3012859</a>","ieee":"S. Bogomolov, M. Forets, G. Frehse, K. Potomkin, and C. Schilling, “Reachability analysis of linear hybrid systems via block decomposition,” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>, vol. 39, no. 11. IEEE, pp. 4018–4029, 2020.","chicago":"Bogomolov, Sergiy, Marcelo Forets, Goran Frehse, Kostiantyn Potomkin, and Christian Schilling. “Reachability Analysis of Linear Hybrid Systems via Block Decomposition.” <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>. IEEE, 2020. <a href=\"https://doi.org/10.1109/TCAD.2020.3012859\">https://doi.org/10.1109/TCAD.2020.3012859</a>.","apa":"Bogomolov, S., Forets, M., Frehse, G., Potomkin, K., &#38; Schilling, C. (2020). Reachability analysis of linear hybrid systems via block decomposition. <i>IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems</i>. IEEE. <a href=\"https://doi.org/10.1109/TCAD.2020.3012859\">https://doi.org/10.1109/TCAD.2020.3012859</a>","ista":"Bogomolov S, Forets M, Frehse G, Potomkin K, Schilling C. 2020. Reachability analysis of linear hybrid systems via block decomposition. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 39(11), 4018–4029."},"month":"11","ec_funded":1,"year":"2020","publication_identifier":{"issn":["02780070"],"eissn":["19374151"]},"status":"public","external_id":{"isi":["000587712700072"],"arxiv":["1905.02458"]},"author":[{"orcid":"0000-0002-0686-0365","first_name":"Sergiy","last_name":"Bogomolov","full_name":"Bogomolov, Sergiy","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"full_name":"Frehse, Goran","first_name":"Goran","last_name":"Frehse"},{"full_name":"Potomkin, Kostiantyn","first_name":"Kostiantyn","last_name":"Potomkin"},{"orcid":"0000-0003-3658-1065","first_name":"Christian","last_name":"Schilling","full_name":"Schilling, Christian","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"oa_version":"Preprint","date_updated":"2023-08-22T13:27:33Z","page":"4018-4029","doi":"10.1109/TCAD.2020.3012859","type":"journal_article","article_type":"original","issue":"11","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grants S11402-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, and the Air Force Office of Scientific Research under award number FA2386-17-1-4065. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the United States Air Force. ","isi":1,"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","article_processing_charge":"No","publisher":"IEEE","day":"01","department":[{"_id":"ToHe"}],"date_created":"2020-11-22T23:01:25Z","volume":39,"abstract":[{"text":"Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous and discrete post operators to compute states reachable according to continuous and discrete dynamics, respectively. In this article, we enhance both of these operators and make sure that most of the involved computations are performed in low-dimensional state space. In particular, we improve the continuous-post operator by performing computations in high-dimensional state space only for time intervals relevant for the subsequent application of the discrete-post operator. Furthermore, the new discrete-post operator performs low-dimensional computations by leveraging the structure of the guard and assignment of a considered transition. We illustrate the potential of our approach on a number of challenging benchmarks.","lang":"eng"}],"oa":1,"_id":"8790","scopus_import":"1","publication_status":"published","language":[{"iso":"eng"}],"publication":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"}