2026-07-23T19:43:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:9564 2024-03-06T10:44:44Z ddc:004 open_access

Relating Syntactic and Semantic Perturbations of Hybrid Automata Roohi, Nima Prabhakar, Pavithra Viswanathan, Mahesh Model Checking Hybrid Automata Approximation Perturbation We investigate how the semantics of a hybrid automaton deviates with respect to syntactic perturbations on the hybrid automaton. We consider syntactic perturbations of a hybrid automaton, wherein the syntactic representations of its elements, namely, initial sets, invariants, guards, and flows, in some logic are perturbed. Our main result establishes a continuity like property that states that small perturbations in the syntax lead to small perturbations in the semantics. More precisely, we show that for every real number epsilon>0 and natural number k, there is a real number delta>0 such that H^delta, the delta syntactic perturbation of a hybrid automaton H, is epsilon-simulation equivalent to H up to k transition steps. As a byproduct, we obtain a proof that a bounded safety verification tool such as dReach will eventually prove the safety of a safe hybrid automaton design (when only non-strict inequalities are used in all constraints) if dReach iteratively reduces the syntactic parameter delta that is used in checking approximate satisfiability. This has an immediate application in counter-example validation in a CEGAR framework, namely, when a counter-example is spurious, then we have a complete procedure for deducing the same. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Nima Roohi and Pavithra Prabhakar and Mahesh Viswanathan 2018 Is Part Of LIPIcs, Volume 118, 29th International Conference on Concurrency Theory (CONCUR 2018) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CONCUR.2018.26 urn:nbn:de:0030-drops-95644 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CONCUR.2018.26 eng https://creativecommons.org/licenses/by/3.0/legalcode