The following pages link to (Q4249569):
Displaying 37 items.
- Reachability analysis of linear systems with stepwise constant inputs (Q271719) (← links)
- Safety verification for probabilistic hybrid systems (Q389835) (← links)
- Theory and computation of discrete state space decompositions for hybrid systems (Q397399) (← links)
- Low dimensional hybrid systems -- decidable, undecidable, don't know (Q418141) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← links)
- Formal analysis of the Schulz matrix inversion algorithm: a paradigm towards computer aided verification of general matrix flow solvers (Q779625) (← links)
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
- Hybrid systems: From verification to falsification by combining motion planning and discrete search (Q1039839) (← links)
- Differential dynamic logic for hybrid systems (Q1040772) (← links)
- Reachability and connectivity queries in constraint databases (Q1394800) (← links)
- Decidable integration graphs. (Q1854273) (← links)
- Decidable hybrid systems (Q1922203) (← links)
- PTIME parametric verification of safety properties for reasonable linear hybrid automata (Q1949771) (← links)
- A decidable class of planar linear hybrid systems (Q2257303) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
- Taylor approximation for hybrid systems (Q2461793) (← links)
- Monotonic hybrid systems (Q2486564) (← links)
- Supervisory control of hybrid systems based on model abstraction and guided search (Q2496813) (← links)
- Discrete-time hybrid modeling and verification of the batch evaporator process benchmark (Q2512159) (← links)
- Expressive power of hybrid systems with variables, parameters and arrays (Q2847407) (← links)
- Towards a hybrid dynamic logic for hybrid dynamic systems (Q2867948) (← links)
- Some decidable results on reachability of solvable systems (Q2871582) (← links)
- A Class of Decidable Parametric Hybrid Systems (Q2996138) (← links)
- Interrupt Timed Automata (Q3617730) (← links)
- Periodically Controlled Hybrid Systems (Q3624588) (← links)
- Property Driven Three-Valued Model Checking on Hybrid Automata (Q3638286) (← links)
- (Q4475110) (← links)
- (Q4484488) (← links)
- Topologies, Continuity and Bisimulations (Q4943548) (← links)
- Approximated Reachability on Hybrid Automata: Falsification meets Certification (Q4982085) (← links)
- (Q5079750) (← links)
- Formal language properties of hybrid systems with strong resets (Q5190079) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- Symbolic reachability computation for families of linear vector fields (Q5945290) (← links)
- Bounded Verification of Reachability of Probabilistic Hybrid Systems (Q6104812) (← links)
- Limit cycles of linear vector fields on \(( \mathbb{S}^2)^m \times \mathbb{R}^N\) (Q6165152) (← links)
