Safety verification of non-linear hybrid systems is quasi-decidable
DOI10.1007/S10703-013-0196-2zbMATH Open1291.68266OpenAlexW2094434555WikidataQ56338523 ScholiaQ56338523MaRDI QIDQ2248097FDOQ2248097
Authors: 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
Recommendations
- Safety verification of non-linear hybrid systems is quasi-semidecidable
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
- Automated Technology for Verification and Analysis
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- Publication:4945221
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Title not available (Why is that?)
- Nonlinear systems.
- Hybrid dynamical systems. Modeling, stability, and robustness
- Set-valued analysis
- What's decidable about hybrid automata?
- Quantifier elimination and cylindrical algebraic decomposition. Proceedings of a symposium, Linz, Austria, October 6--8, 1993
- Interval Methods for Systems of Equations
- Title not available (Why is that?)
- Some undecidable problems involving elementary functions of a real variable
- Solutions to hybrid inclusions via set and graphical convergence with stability theory applications
- Title not available (Why is that?)
- A survey on continuous time computations
- Continuity and computability of reachable sets
- Semantics and computability of the evolution of hybrid systems
- Title not available (Why is that?)
- Safety verification of non-linear hybrid systems is quasi-semidecidable
- Title not available (Why is that?)
- Algorithmic analysis of nonlinear hybrid systems
- Dynamical properties of timed automata
- Quantified constraints under perturbation
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
Cited In (11)
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test
- On generalized two dimensional linear hybrid dynamical systems
- Safety verification of non-linear hybrid systems is quasi-semidecidable
- Decidability of verification of safety properties of spatial families of linear hybrid automata
- Assume-guarantee verification of nonlinear hybrid systems with ARIADNE
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- Title not available (Why is that?)
- A delta-sampling verification theorem for discrete-time, possibly discontinuous systems
- Automated Technology for Verification and Analysis
- GUARANTEED TERMINATION IN THE VERIFICATION OF LTL PROPERTIES OF NON-LINEAR ROBUST DISCRETE TIME HYBRID SYSTEMS
- Stabhyli -- a tool for automatic stability verification of non-linear hybrid systems
This page was built for publication: Safety verification of non-linear hybrid systems is quasi-decidable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248097)
