Safety verification of non-linear hybrid systems is quasi-decidable

DOI10.1007/s10703-013-0196-2zbMath1291.68266WikidataQ56338523 ScholiaQ56338523MaRDI QIDQ2248097

Stefan Ratschan

Publication date: 30 June 2014

Published in: Formal Methods in System Design (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10703-013-0196-2

zbMATH Keywords

robustness; hybrid systems; decidability; safety verification

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q60: Specification and verification (program logics, model checking, etc.)

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

Cites Work

• Solutions to hybrid inclusions via set and graphical convergence with stability theory applications
• What's decidable about hybrid automata?
• Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
• Quantified constraints under perturbation
• Dynamical properties of timed automata
• Continuity and computability of reachable sets
• Semantics and Computability of the Evolution of Hybrid Systems
• GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
• Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable
• Interval Methods for Systems of Equations
• Algorithmic analysis of nonlinear hybrid systems
• Some undecidable problems involving elementary functions of a real variable
• Set-valued analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item