Pages that link to "Item:Q1273866"
From MaRDI portal
The following pages link to What's decidable about hybrid automata? (Q1273866):
Displayed 20 items.
- Hybridization methods for the analysis of nonlinear systems (Q868432) (← links)
- Symbolic models for control systems (Q868433) (← links)
- Semantics and pragmatics of real-time maude (Q880982) (← links)
- Verification of duration systems using an approximation approach (Q1429422) (← links)
- Positive loop-closed automata: A decidable class of hybrid systems (Q1858439) (← links)
- On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
- Taylor approximation for hybrid systems (Q2461793) (← links)
- Formal verification of multitasking applications based on timed automata model (Q2475307) (← links)
- Abstractions for hybrid systems (Q2475634) (← links)
- Optimal persistent disturbance attenuation control for linear hybrid systems (Q2496817) (← links)
- On time optimal control of integrator switched systems with state constraints (Q2572189) (← links)
- Task automata: Schedulability, decidability and undecidability (Q2643078) (← links)
- Zeno hybrid systems (Q2716782) (← links)
- Approximating Continuous Systems by Timed Automata (Q3506869) (← links)
- Interrupt Timed Automata (Q3617730) (← links)
- Property Driven Three-Valued Model Checking on Hybrid Automata (Q3638286) (← links)
- Topologies, Continuity and Bisimulations (Q4943548) (← links)
- Language-Based Abstraction Refinement for Hybrid System Verification (Q5452604) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)