III: 10, 152-154, LNM 88 (1969)
MEYER, Paul-André
Un résultat élémentaire sur les temps d'arrêt (General theory of processes)
This useful result asserts that a stopping time is accessible if and only if its graph is contained in a countable union of graphs of previsible stopping times
Comment: Before this was noticed, accessible stopping times were considered important. After this remark, previsible stopping times came to the forefront
Keywords: Stopping times, Accessible times, Previsible times
Nature: Original
Retrieve article from Numdam

---