Pages that link to "Item:Q1273866"
From MaRDI portal
The following pages link to What's decidable about hybrid automata? (Q1273866):
Displaying 50 items.
- Deadness and how to disprove liveness in hybrid dynamical systems (Q2629097) (← links)
- On the complexity of bounded time and precision reachability for piecewise affine systems (Q2636516) (← links)
- Task automata: Schedulability, decidability and undecidability (Q2643078) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Zeno hybrid systems (Q2716782) (← links)
- Hierarchical Hybrid Symbolic Robot Motion Planning and Control (Q2789892) (← links)
- Towards an Efficient Path-Oriented Tool for Bounded Reachability Analysis of Linear Hybrid Systems using Linear Programming (Q2864385) (← links)
- Some decidable results on reachability of solvable systems (Q2871582) (← links)
- Verification and Control of Probabilistic Rectangular Hybrid Automata (Q2945577) (← links)
- Nested Timed Automata with Frozen Clocks (Q2945595) (← links)
- Succinct discrete time approximations of distributed hybrid automata (Q2985857) (← links)
- Accurate hybridization of nonlinear systems (Q2985859) (← links)
- Compositional analysis for linear control systems (Q2985860) (← links)
- On integration of event-based estimation and robust MPC in a feedback loop (Q2985861) (← links)
- From synchronous programs to symbolic representations of hybrid systems (Q2985863) (← links)
- A descent algorithm for the optimal control of constrained nonlinear switched dynamical systems (Q2985865) (← links)
- Timed automata with observers under energy constraints (Q2985866) (← links)
- Real-time scheduling of mixture-of-experts systems with limited resources (Q2985868) (← links)
- On a control algorithm for time-varying processor availability (Q2985869) (← links)
- Timed I/O automata (Q2985870) (← links)
- Receding horizon control for temporal logic specifications (Q2985871) (← links)
- Synthesis using approximately bisimilar abstractions (Q2985872) (← links)
- Oscillation analysis of linearly coupled piecewise affine systems (Q2985873) (← links)
- On infinity norms as Lyapunov functions for piecewise affine systems (Q2985874) (← links)
- Identifiability of discrete-time linear switched systems (Q2985875) (← links)
- Rank properties of poincare maps for hybrid systems with applications to bipedal walking (Q2985876) (← links)
- Stealthy deception attacks on water SCADA systems (Q2985877) (← links)
- Comparison of overapproximation methods for stability analysis of networked control systems (Q2985878) (← links)
- Distributed Kalman Filter algorithms for self-localization of mobile devices (Q2985880) (← links)
- Convergence results for ant routing algorithms viastochastic approximation (Q2985881) (← links)
- Monte-carlo techniques for falsification of temporal properties of non-linear hybrid systems (Q2985883) (← links)
- Automatic invariant generation for hybrid systems using ideal fixed points (Q2985884) (← links)
- Safe compositional network sketches (Q2985887) (← links)
- Bayesian statistical model checking with application to Simulink/Stateflow verification (Q2985888) (← links)
- On the connections between PCTL and dynamic programming (Q2985889) (← links)
- Modeling and verification of stochastic hybrid systems using HIOA (Q2985890) (← links)
- A generating function approach to the stability of discrete-time switched linear systems (Q2985891) (← links)
- Stabilization of planar switched linear systems using polar coordinates (Q2985893) (← links)
- Amir Pnueli and the dawn of hybrid systems (Q2985894) (← links)
- On Reachability for Hybrid Automata over Bounded Time (Q3012937) (← links)
- Reachability analysis of rational eigenvalue linear systems (Q3072442) (← links)
- Model Checking Real-Time Systems (Q3176387) (← links)
- Verification of Hybrid Systems (Q3176388) (← links)
- Symbolic Model Checking in Non-Boolean Domains (Q3176389) (← links)
- (Q3384178) (← links)
- On The Complexity of Bounded Time Reachability for Piecewise Affine Systems (Q3447692) (← links)
- Symbolic models for time-varying time-delay systems via alternating approximate bisimulation (Q3465677) (← links)
- Approximating Continuous Systems by Timed Automata (Q3506869) (← links)
- CONTINUOUS PETRI NETS: EXPRESSIVE POWER AND DECIDABILITY ISSUES (Q3552522) (← links)
- Interrupt Timed Automata (Q3617730) (← links)
