Pages that link to "Item:Q5945290"

The following pages link to Symbolic reachability computation for families of linear vector fields (Q5945290):

Displaying 40 items.

• Interrupt timed automata: verification and expressiveness (Q453513) (← links)
• Quantifier-free encoding of invariants for hybrid systems (Q479826) (← links)
• Barrier certificates revisited (Q507352) (← links)
• Reachability computation for polynomial dynamical systems (Q526433) (← links)
• Synthesizing invariant barrier certificates via difference-of-convex programming (Q832194) (← links)
• Geometry and topology of parameter space: Investigating measures of robustness in regulatory networks (Q843306) (← links)
• Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
• Exact safety verification of hybrid systems using sums-of-squares representation (Q893625) (← links)
• Understanding deadlock and livelock behaviors in hybrid control systems (Q924105) (← links)
• Solving and visualizing nonlinear parametric constraints in control based on quantifier elimination (Q945005) (← links)
• MetiTarski: An automatic theorem prover for real-valued special functions (Q972422) (← links)
• Span-reachability and observability of bilinear hybrid systems (Q987608) (← links)
• Inclusion dynamics hybrid automata (Q999262) (← links)
• First-order orbit queries (Q2048201) (← links)
• A semantic model for interacting cyber-physical systems (Q2079682) (← links)
• Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming (Q2105455) (← links)
• Pegasus: sound continuous invariant generation (Q2147687) (← links)
• Conservative time discretization: a comparative study (Q2165508) (← links)
• Algorithmic analysis of polygonal hybrid systems. I: Reachability (Q2373713) (← links)
• Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems (Q2402231) (← links)
• Positive root isolation for poly-powers by exclusion and differentiation (Q2409014) (← links)
• \(\epsilon\)-semantics computations on biological systems (Q2453211) (← links)
• Algorithmic analysis of polygonal hybrid systems. II: Phase portrait and tools (Q2474069) (← links)
• Abstractions for hybrid systems (Q2475634) (← links)
• Constructing invariants for hybrid systems (Q2475635) (← links)
• Characterization and computation of control invariant sets for linear impulsive control systems (Q2677090) (← links)
• A piecewise ellipsoidal reachable set estimation method for continuous bimodal piecewise affine systems (Q2677116) (← links)
• Some decidable results on reachability of solvable systems (Q2871582) (← links)
• Formal Modelling, Analysis and Verification of Hybrid Systems (Q2948232) (← links)
• Reachability analysis of rational eigenvalue linear systems (Q3072442) (← links)
• Theory and computational techniques for analysis of discrete-time control systems with disturbances (Q3096879) (← links)
• Verification of Hybrid Systems (Q3176388) (← links)
• Linear Temporal Logic Satisfaction in Adversarial Environments Using Secure Control Barrier Certificates (Q3297675) (← links)
• Reachability and optimal control for linear hybrid automata: a quantifier elimination approach (Q3447004) (← links)
• Sampling-based Algorithm for Testing and Validating Robot Controllers (Q3578180) (← links)
• Interrupt Timed Automata (Q3617730) (← links)
• (Q5089299) (← links)
• (Q5090452) (← links)
• Synthesis of controllers for target problems of hybrid systems using approximate computation (Q5758287) (← links)
• Limit cycles of linear vector fields on \(( \mathbb{S}^2)^m \times \mathbb{R}^N\) (Q6165152) (← links)