Thanks to significant progress in the adopted implementation techniques, the recent years have witnessed a renewed interest in the development of analysis tools based on the domain of convex polyhedra. In this paper we revisit the application of this abstract domain to the case of reachability analysis for hybrid systems, focusing on the lesson learned during the development of the tool PHAVerLite. In particular, we motivate the implementation of specialized versions of several well known abstract operators, as well as the adoption of a heuristic technique (boxed polyhedra) for the handling of finite collections of polyhedra, showing their impact on the efficiency of the analysis tool.
CITATION STYLE
Becchi, A., & Zaffanella, E. (2019). Revisiting Polyhedral Analysis for Hybrid Systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11822 LNCS, pp. 183–202). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-32304-2_10
Mendeley helps you to discover research relevant for your work.