Approximated Reachability on Hybrid Automata: Falsification meets Certification | Zendy

Kerstin Bauer | Zendy; Raffaella Gentilini | Zendy; Klaus Schneider | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Approximated Reachability on Hybrid Automata: Falsification meets Certification

Author(s) -

Kerstin Bauer,

Raffaella Gentilini,

Klaus Schneider

Publication year - 2008

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2008.12.030

Subject(s) - reachability , automaton , representation (politics) , computer science , bounded function , context (archaeology) , theoretical computer science , reachability problem , certification , hybrid system , hybrid automaton , preorder , discrete mathematics , mathematics , algorithm , mathematical analysis , paleontology , machine learning , politics , political science , law , biology

Undecidability of the reachability problem is ubiquitous in the context of hybrid automata. Being mostly based on either bounded reachability or on the notion of simulation preorder, current techniques for the approximated reachability analysis force to choose between under- and over-approximations.In this paper, we introduce a novel method for the reachability analysis of hybrid automata featuring (1) the ability of combining the certification and the falsification of reachability properties, and (2) the applicability to highly expressive families of hybrid automata, whose dynamics are not amenable to an exact representation

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research