{"ddc":["000"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file_date_updated":"2020-07-14T12:47:43Z","oa":1,"page":"132","status":"public","citation":{"short":"M. Giacobbe, Automatic Time-Unbounded Reachability Analysis of Hybrid Systems, Institute of Science and Technology Austria, 2019.","ama":"Giacobbe M. Automatic time-unbounded reachability analysis of hybrid systems. 2019. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6894\">10.15479/AT:ISTA:6894</a>","mla":"Giacobbe, Mirco. <i>Automatic Time-Unbounded Reachability Analysis of Hybrid Systems</i>. Institute of Science and Technology Austria, 2019, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:6894\">10.15479/AT:ISTA:6894</a>.","ieee":"M. Giacobbe, “Automatic time-unbounded reachability analysis of hybrid systems,” Institute of Science and Technology Austria, 2019.","ista":"Giacobbe M. 2019. Automatic time-unbounded reachability analysis of hybrid systems. Institute of Science and Technology Austria.","chicago":"Giacobbe, Mirco. “Automatic Time-Unbounded Reachability Analysis of Hybrid Systems.” Institute of Science and Technology Austria, 2019. <a href=\"https://doi.org/10.15479/AT:ISTA:6894\">https://doi.org/10.15479/AT:ISTA:6894</a>.","apa":"Giacobbe, M. (2019). <i>Automatic time-unbounded reachability analysis of hybrid systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:6894\">https://doi.org/10.15479/AT:ISTA:6894</a>"},"date_created":"2019-09-22T14:08:44Z","month":"09","article_processing_charge":"No","department":[{"_id":"ToHe"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Hybrid automata combine finite automata and dynamical systems, and model the interaction of digital with physical systems. Formal analysis that can guarantee the safety of all behaviors or rigorously witness failures, while unsolvable in general, has been tackled algorithmically using, e.g., abstraction, bounded model-checking, assisted theorem proving.\r\nNevertheless, very few methods have addressed the time-unbounded reachability analysis of hybrid automata and, for current sound and automatic tools, scalability remains critical. We develop methods for the polyhedral abstraction of hybrid automata, which construct coarse overapproximations and tightens them incrementally, in a CEGAR fashion. We use template polyhedra, i.e., polyhedra whose facets are normal to a given set of directions.\r\nWhile, previously, directions were given by the user, we introduce (1) the first method\r\nfor computing template directions from spurious counterexamples, so as to generalize and\r\neliminate them. The method applies naturally to convex hybrid automata, i.e., hybrid\r\nautomata with (possibly non-linear) convex constraints on derivatives only, while for linear\r\nODE requires further abstraction. Specifically, we introduce (2) the conic abstractions,\r\nwhich, partitioning the state space into appropriate (possibly non-uniform) cones, divide\r\ncurvy trajectories into relatively straight sections, suitable for polyhedral abstractions.\r\nFinally, we introduce (3) space-time interpolation, which, combining interval arithmetic\r\nand template refinement, computes appropriate (possibly non-uniform) time partitioning\r\nand template directions along spurious trajectories, so as to eliminate them.\r\nWe obtain sound and automatic methods for the reachability analysis over dense\r\nand unbounded time of convex hybrid automata and hybrid automata with linear ODE.\r\nWe build prototype tools and compare—favorably—our methods against the respective\r\nstate-of-the-art tools, on several benchmarks."}],"author":[{"last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87","first_name":"Mirco","full_name":"Giacobbe, Mirco","orcid":"0000-0001-8180-0904"}],"doi":"10.15479/AT:ISTA:6894","_id":"6894","related_material":{"record":[{"id":"631","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"647","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"140"}]},"alternative_title":["ISTA Thesis"],"publication_identifier":{"eissn":["2663-337X"]},"supervisor":[{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"}],"date_updated":"2023-09-19T09:30:43Z","type":"dissertation","has_accepted_license":"1","date_published":"2019-09-30T00:00:00Z","degree_awarded":"PhD","year":"2019","publisher":"Institute of Science and Technology Austria","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"30","oa_version":"Published Version","title":"Automatic time-unbounded reachability analysis of hybrid systems","file":[{"content_type":"application/pdf","file_size":4100685,"checksum":"773beaf4a85dc2acc2c12b578fbe1965","date_created":"2019-09-27T14:15:05Z","relation":"main_file","file_name":"giacobbe_thesis.pdf","access_level":"open_access","date_updated":"2020-07-14T12:47:43Z","creator":"mgiacobbe","file_id":"6916"},{"content_type":"application/gzip","file_size":7959732,"access_level":"closed","relation":"source_file","file_name":"giacobbe_thesis_src.tar.gz","date_created":"2019-09-27T14:22:04Z","checksum":"97f1c3da71feefd27e6e625d32b4c75b","file_id":"6917","creator":"mgiacobbe","date_updated":"2020-07-14T12:47:43Z"}],"language":[{"iso":"eng"}]}