RSOLVER

swMATH4334MaRDI QIDQ16513FDOQ16513

Author name not available (Why is that?)

Cited In (75)

• On the complexity of quantified linear systems
• Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro}
• Hybrid Systems: Computation and Control
• Rigorous integration of non-linear ordinary differential equations in Chebyshev basis
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
• Verifying safety properties of a nonlinear control by interactive theorem proving with the prototype verification system
• Implicit definitions with differential equations for KeYmaera X (system description)
• Computing reachable sets for uncertain nonlinear hybrid systems using interval constraint-propagation techniques
• Assume–guarantee verification of nonlinear hybrid systems with <scp>Ariadne</scp>
• Title not available (Why is that?)
• Constraints for Continuous Reachability in the Verification of Hybrid Systems
• Control barrier functions for stochastic systems
• Algorithm 875
• Deadness and how to disprove liveness in hybrid dynamical systems
• Improving SAT Modulo ODE for Hybrid Systems Analysis by Combining Different Enclosure Methods
• Tightened reachability constraints for the verification of linear hybrid systems
• Real World Verification
• On quantified linear implications
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• An approximation algorithm for box abstraction of transition systems on real state spaces
• Fuzzy answer set computation via satisfiability modulo theories
• A compositional modelling and analysis framework for stochastic hybrid systems
• Formal Modelling, Analysis and Verification of Hybrid Systems
• MetiTarski: An automatic theorem prover for real-valued special functions
• Taylor approximation for hybrid systems
• A Constraint Satisfaction Framework for Executing Perceptions and Actions in Diagrammatic Reasoning
• On a decision procedure for quantified linear programs
• Polynomial function intervals for floating-point software verification
• Hybrid automata-based CEGAR for rectangular hybrid systems
• Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
• raSAT: an SMT solver for polynomial constraints
• Verification of Hybrid Systems
• Syntax and consistent equation semantics of hybrid Chi
• Discovering polynomial Lyapunov functions for continuous dynamical systems
• Contractor programming
• The Reach-and-Evolve Algorithm for Reachability Analysis of Nonlinear Dynamical Systems
• Efficient solution of a class of quantified constraints with quantifier prefix exists-forall
• Providing a Basin of Attraction to a Target Region of Polynomial Systems by Computation of Lyapunov-Like Functions
• Crossing the Bridge between Similar Games
• Principles and Practice of Constraint Programming – CP 2003
• A complexity perspective on entailment of parameterized linear constraints
• Applications of MetiTarski in the Verification of Control and Hybrid Systems
• Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers
• An efficient framework for barrier certificate generation of uncertain nonlinear hybrid systems
• Extracting counterexamples induced by safety violation in linear hybrid systems
• Hybrid automata, reachability, and systems biology
• Efficient handling of universally quantified inequalities
• Hybrid systems: From verification to falsification by combining motion planning and discrete search
• Automated Machine-Checked Hybrid System Safety Proofs
• Quasi-decidability of a fragment of the first-order theory of real numbers
• Hybrid Automata in Systems Biology: How Far Can We Go?
• Learning safe neural network controllers with barrier certificates
• raSAT: An SMT Solver for Polynomial Constraints
• Barrier certificates revisited
• Analyzing restricted fragments of the theory of linear arithmetic
• Computational complexity of determining which statements about causality hold in different space-time models
• Formal verification and quantitative metrics of MPSoC data dynamics
• Construction of parametric barrier functions for dynamical systems using interval analysis
• Synthesizing invariant barrier certificates via difference-of-convex programming
• Exact safety verification of hybrid systems using sums-of-squares representation
• Quantified set inversion algorithm with applications to control
• A semi-algebraic approach for asymptotic stability analysis
• Symbolic Model Checking of Hybrid Systems Using Template Polyhedra
• Efficient solving of quantified inequality constraints over the real numbers
• Safety verification for probabilistic hybrid systems
• Approximated Reachability on Hybrid Automata: Falsification meets Certification
• Relating syntactic and semantic perturbations of hybrid automata
• An Introduction to the Verification of Hybrid Systems Using Ariadne
• Property Driven Three-Valued Model Checking on Hybrid Automata
• Decision algorithms for fragments of real analysis. I: Continuous functions with strict convexity and concavity predicates
• Erratum to: ``Analyzing restricted fragments of the theory of linear arithmetic
• Finding Errors of Hybrid Systems by Optimising an Abstraction-Based Quality Estimate
• Incremental Computation of Succinct Abstractions for Hybrid Systems
• Formal Verification Applied to Robotic Surgery

This page was built for software: RSOLVER