Data di Pubblicazione:
2016
Abstract:
We consider infinite-state Markov decision processes (MDPs) that are induced by extensions of vector addition systems with states (VASS). Verification conditions for these MDPs are described by reachability and Buchi objectives w.r.t. given sets of control-states. We study the decidability of some qualitative versions of these objectives, i.e., the decidability of whether such objectives can be achieved surely, almost-surely, or limit-surely. While most such problems are undecidable in general, some are decidable for large subclasses in which either only the controller or only the random environment can change the counter values (while the other side can only change control-states).
Tipologia CRIS:
04A-Conference paper in volume
Keywords:
Computer Science (all); Theoretical Computer Science
Elenco autori:
Abdulla, Parosh Aziz; Ciobanu, Radu; Mayr, Richard; Sangnier, Arnaud; Sproston, Jeremy
Link alla scheda completa:
Link al Full Text:
Titolo del libro:
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pubblicato in: