A4.D — On Decidability of Time-bounded Reachability in CTMDPs
Why the open web links it
Discusses decidability of time-bounded reachability in continuous-time Markov decision processes.
Linked by 2 independent sites, 2 of them widely read in the 2026-10 crawl of the open web, including mpg.de, mpi-sws.org.