Pages that link to "Item:Q3512493"
From MaRDI portal
The following pages link to Constraint-Based Approach for Analysis of Hybrid Systems (Q3512493):
Displaying 27 items.
- Finite abstractions for hybrid systems with stable continuous dynamics (Q434462) (← links)
- Barrier certificates revisited (Q507352) (← links)
- Construction of parametric barrier functions for dynamical systems using interval analysis (Q518335) (← links)
- A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
- Synthesizing invariant barrier certificates via difference-of-convex programming (Q832194) (← links)
- Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
- Computing differential invariants of hybrid systems as fixed points (Q1039853) (← links)
- A survey of some methods for real quantifier elimination, decision, and satisfiability and their applications (Q1701667) (← links)
- Unbounded-time safety verification of guarded LTI models with inputs by abstract acceleration (Q2031413) (← links)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
- Pegasus: sound continuous invariant generation (Q2147687) (← links)
- Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants (Q2331077) (← links)
- Generating invariants for non-linear hybrid systems (Q2355695) (← links)
- Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems (Q2402231) (← links)
- A compositional modelling and verification framework for stochastic hybrid systems (Q2403530) (← links)
- Discovering polynomial Lyapunov functions for continuous dynamical systems (Q2437283) (← links)
- Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants (Q2842646) (← links)
- Unbounded-Time Analysis of Guarded LTI Systems with Inputs by Abstract Acceleration (Q2949859) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
- Abstractions Refinement for Hybrid Systems Diagnosability Analysis (Q5117254) (← links)
- Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic (Q5191109) (← links)
- Hierarchical Reasoning for the Verification of Parametric Systems (Q5747759) (← links)
- Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis (Q5915714) (← links)
