Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.
2022.What’s Decidable About Discrete Linear Dynamical Systems?Springer Nature Switzerland, Cham, 21–38
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Formalizes PCTL on MJLSs to specify and check moment-based stability properties for prescribed initial state sets using linear-algebraic techniques.
citing papers explorer
-
On the Subspace Orbit Problem and the Simultaneous Skolem Problem
Decidability of the Orbit Problem for logarithmic-dimensional target subspaces and Skolem-hardness for linear-dimensional targets.
-
Stability Checking of Markov Jump Linear Systems via Probabilistic Temporal Logic (Extended Version)
Formalizes PCTL on MJLSs to specify and check moment-based stability properties for prescribed initial state sets using linear-algebraic techniques.