Pages that link to "Item:Q5941097"
From MaRDI portal
The following pages link to Deciding stability and mortality of piecewise affine dynamical systems (Q5941097):
Displayed 24 items.
- On the decidability and complexity of problems for restricted hierarchical hybrid systems (Q338386) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← links)
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- Termination of linear programs with nonlinear constraints (Q604395) (← links)
- Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs (Q681342) (← links)
- A dynamical system which must be stable whose stability cannot be proved (Q703488) (← links)
- On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
- Topological formulation of termination properties of iterates of functions (Q1029041) (← links)
- On the presence of periodic configurations in Turing machines and in counter machines. (Q1853547) (← links)
- On the mortality problem: from multiplicative matrix equations to linear recurrence sequences and beyond (Q2051775) (← links)
- Reachability problems in low-dimensional nondeterministic polynomial maps over integers (Q2051802) (← links)
- Deciding the point-to-fixed-point problem for skew tent maps on an interval (Q2208250) (← links)
- The stability of the deterministic Skorokhod problem is undecidable (Q2339927) (← links)
- On the Termination of Integer Loops (Q2891402) (← links)
- Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ (Q2960427) (← links)
- Reachability Problems for One-Dimensional Piecewise Affine Maps (Q3177337) (← links)
- STORMED Hybrid Systems (Q3519497) (← links)
- REACHABILITY PROBLEMS IN LOW-DIMENSIONAL ITERATIVE MAPS (Q3526544) (← links)
- About the Domino Problem for Subshifts on Groups (Q4613553) (← links)
- On the Mortality Problem: From Multiplicative Matrix Equations to Linear Recurrence Sequences and Beyond (Q5092447) (← links)
- On the Undecidability of the Tiling Problem (Q5448639) (← links)
- A survey of computational complexity results in systems and control (Q5926262) (← links)
- The stability of saturated linear dynamical systems is undecidable (Q5943100) (← links)
- Mortality and Edge-to-Edge Reachability are Decidable on Surfaces (Q6120709) (← links)