Pages that link to "Item:Q2475635"

The following pages link to Constructing invariants for hybrid systems (Q2475635):

Displaying 18 items.

• SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
• Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
• A search-based procedure for nonlinear real arithmetic (Q518407) (← links)
• A hierarchy of proof rules for checking positive invariance of algebraic and semi-algebraic sets (Q681340) (← links)
• Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
• Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
• Invariants for parameterised Boolean equation systems (Q960855) (← links)
• Safety verification of interconnected hybrid systems using barrier certificates (Q1793125) (← links)
• Pegasus: sound continuous invariant generation (Q2147687) (← links)
• Reachable set estimation and safety verification of nonlinear systems via iterative sums of squares programming (Q2165452) (← links)
• Verifying safety and persistence in hybrid systems using flowpipes and continuous invariants (Q2331077) (← links)
• Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← links)
• Generating invariants for non-linear hybrid systems (Q2355695) (← links)
• Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
• Verification of Hybrid Systems (Q3176388) (← links)
• Invariants for Parameterised Boolean Equation Systems (Q3541018) (← links)
• (Q5089299) (← links)
• Validating numerical semidefinite programming solvers for polynomial invariants (Q5916266) (← links)