Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1576916,
author = {Brázdil, Tomáš and Chatterjee, Krishnendu and Kučera, Antonín and Novotný, Petr and Velan, Dominik},
address = {Cham},
booktitle = {Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Proceedings},
doi = {http://dx.doi.org/10.1007/978-3-030-31784-3_27},
editor = {Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza},
keywords = {angelic and demonic nondeterminism; termination time; probabilistic VASS},
howpublished = {tištěná verze "print"},
language = {eng},
location = {Cham},
isbn = {978-3-030-31783-6},
pages = {462-478},
publisher = {Springer},
title = {Deciding Fast Termination for Probabilistic VASS with Nondeterminism},
url = {https://doi.org/10.1007/978-3-030-31784-3_27},
year = {2019}
}
TY - JOUR
ID - 1576916
AU - Brázdil, Tomáš - Chatterjee, Krishnendu - Kučera, Antonín - Novotný, Petr - Velan, Dominik
PY - 2019
TI - Deciding Fast Termination for Probabilistic VASS with Nondeterminism
PB - Springer
CY - Cham
SN - 9783030317836
KW - angelic and demonic nondeterminism
KW - termination time
KW - probabilistic VASS
UR - https://doi.org/10.1007/978-3-030-31784-3_27
L2 - https://doi.org/10.1007/978-3-030-31784-3_27
N2 - A probabilistic vector addition system with states (pVASS) is a finite state Markov process augmented with non-negative integer counters that can be incremented or decremented during each state transition, blocking any behaviour that would cause a counter to decrease below zero. The pVASS can be used as abstractions of probabilistic programs with many decidable properties. The use of pVASS as abstractions requires the presence of nondeterminism in the model. In this paper, we develop techniques for checking fast termination of pVASS with nondeterminism. That is, for every initial configuration of size n, we consider the worst expected number of transitions needed to reach a configuration with some counter negative (the expected termination time). We show that the problem whether the asymptotic expected termination time is linear is decidable in polynomial time for a certain natural class of pVASS with nondeterminism. Furthermore, we show the following dichotomy: if the asymptotic expected termination time is not linear, then it is at least quadratic, i.e., in Omega(n^2).
ER -
BRÁZDIL, Tomáš, Krishnendu CHATTERJEE, Antonín KUČERA, Petr NOVOTNÝ and Dominik VELAN. Deciding Fast Termination for Probabilistic VASS with Nondeterminism. In Yu-Fang Chen, Chih-Hong Cheng, Javier Esparza. \textit{Automated Technology for Verification and Analysis - 17th International Symposium, ATVA 2019, Proceedings}. Cham: Springer, 2019, p.~462-478. ISBN~978-3-030-31783-6. Available from: https://dx.doi.org/10.1007/978-3-030-31784-3\_{}27.
|
