Pages that link to "Item:Q477610"
From MaRDI portal
The following pages link to Reachability problems for Markov chains (Q477610):
Displaying 15 items.
- Decidable and expressive classes of probabilistic automata (Q1740668) (← links)
- The complexity of synchronizing Markov decision processes (Q1740670) (← links)
- On eventual non-negativity and positivity for the weighted sum of powers of matrices (Q2104554) (← links)
- When are emptiness and containment decidable for probabilistic automata? (Q2662671) (← links)
- (Q5009460) (← links)
- (Q5015397) (← links)
- Sequential Relational Decomposition (Q5094122) (← links)
- Complexity of Restricted Variants of Skolem and Related Problems (Q5111295) (← links)
- Decision Questions for Probabilistic Automata on Small Alphabets (Q6137871) (← links)
- Model checking linear dynamical systems under floating-point rounding (Q6535340) (← links)
- A probabilistic logic for verifying continuous-time Markov chains (Q6535602) (← links)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives (Q6535681) (← links)
- Skolem and positivity completeness of ergodic Markov chains (Q6551702) (← links)
- Positivity-hardness results on Markov decision processes (Q6566469) (← links)
- On the Skolem problem and the Skolem conjecture (Q6649433) (← links)
