Relating syntactic and semantic perturbations of hybrid automata

DOI10.4230/LIPICS.CONCUR.2018.26OpenAlexW2888883715MaRDI QIDQ5009441

Mahesh Viswanathan, Pavithra Prabhakar, Nima Roohi

Publication date: 4 August 2021

Full work available at URL: https://doi.org/10.4230/LIPIcs.CONCUR.2018.26

zbMATH Keywords

perturbationapproximationhybrid automatamodel checking

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Uses Software

• RSOLVER

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximately bisimilar symbolic models for nonlinear control systems
• Robust safety of timed automata
• Quantified constraints under perturbation
• Dynamical properties of timed automata
• Quasi-decidability of a fragment of the first-order theory of real numbers
• Taylor approximation for hybrid systems
• δ-Complete Decision Procedures for Satisfiability over the Reals
• A dynamic algorithm for approximate flow computations
• Delta-Decidability over the Reals
• Robust Model-Checking of Timed Automata via Pumping in Channel Machines
• Robust Model-Checking of Linear-Time Properties in Timed Automata
• Robust Model Checking of Timed Automata under Clock Drifts
• Efficient solving of quantified inequality constraints over the real numbers
• Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
• Hybrid Systems: Computation and Control

This page was built for publication: Relating syntactic and semantic perturbations of hybrid automata