Markov decision processes and regular events. (English) Zbl 0765.68152
Automata, languages and programming, Proc. 17th Int. Colloq., Warwick/GB 1990, Lect. Notes Comput. Sci. 443, 336-349 (1990).
Summary: [For the entire collection see Zbl 0758.00017.]
Desirable properties of the infinite histories of a finite state Markov decision process are specified in terms of a finite number of events represented as \(\omega\)-regular sets. An infinite history of the process produces a reward which depends on the properties it satisfies. We investigate the existence of optimal policies and provide algorithms for the construction of such policies.
Desirable properties of the infinite histories of a finite state Markov decision process are specified in terms of a finite number of events represented as \(\omega\)-regular sets. An infinite history of the process produces a reward which depends on the properties it satisfies. We investigate the existence of optimal policies and provide algorithms for the construction of such policies.
MSC:
| 68Q45 | Formal languages and automata |
| 68Q60 | Specification and verification (program logics, model checking, etc.) |
