The following pages link to (Q4249569):
Displayed 17 items.
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Interrupt timed automata: verification and expressiveness (Q453513) (← 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)
- PTIME parametric verification of safety properties for reasonable linear hybrid automata (Q1949771) (← 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)
- Interrupt Timed Automata (Q3617730) (← links)
- Periodically Controlled Hybrid Systems (Q3624588) (← links)
- Property Driven Three-Valued Model Checking on Hybrid Automata (Q3638286) (← links)
- Topologies, Continuity and Bisimulations (Q4943548) (← 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)