George Kenison
George Kenison
Home
Publications
Posts
CV
Light
Dark
Automatic
Stochastic Reachability
What is decidable about the Stochastic Reachability Problem?
We consider the open Stochastic Reachability Problem: given a stochastic matrix $K\in\mathbb{Q}^{d\times d}$, probability …
G. Kenison
PDF
Cite
Cite
×