The following pages link to (Q4953389):
Displaying 21 items.
- On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386) (← links)
- Computation with perturbed dynamical systems (Q355515) (← links)
- Robust reachability in timed automata and games: a game-based approach (Q481098) (← links)
- Robustness of temporal logic specifications for continuous-time signals (Q732015) (← links)
- Semi-formal verification of the steady state behavior of mixed-signal circuits by SAT-based property checking (Q947801) (← links)
- Time robustness in MTL and expressivity in hybrid system falsification (Q1702902) (← links)
- Decisiveness of stochastic systems and its application to hybrid models (Q2105467) (← links)
- Safety verification of non-linear hybrid systems is quasi-decidable (Q2248097) (← links)
- Entropy of regular timed languages (Q2343131) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)
- Thin and Thick Timed Regular Languages (Q3172847) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- Time-Bounded Verification (Q3184695) (← links)
- (Q4484488) (← links)
- Relating syntactic and semantic perturbations of hybrid automata (Q5009441) (← links)
- (Q5021008) (← links)
- The Unmet Challenge of Timed Systems (Q5170750) (← links)
- Probabilistic and Topological Semantics for Timed Automata (Q5458833) (← links)
- A Practical Approach to Discretised PDDL+ Problems by Translation to Numeric Planning (Q5870537) (← links)
- Testing membership for timed automata (Q6090987) (← links)
- A computable and compositional semantics for hybrid systems (Q6614877) (← links)
