




Publications  LongRun Average Behaviour of Probabilistic Vector Addition Systems





Reference:
Tomáš Brázdil, Stefan Kiefer, Antonín Kučera, and Petr Novotný. Longrun average behaviour of probabilistic vector addition systems. In Proceedings of the 30th Annual Symposium on Logic in Computer Science (LICS), pages 44–55, Kyoto, Japan, 2015. IEEE.
Abstract:
We study the pattern frequency vector for runs in probabilistic Vector Addition Systems with States (pVASS). Intuitively, each configuration of a given pVASS is assigned one of finitely many patterns, and every run can thus be seen as an infinite sequence of these patterns. The pattern frequency vector assigns to each run the limit of pattern frequencies computed for longer and longer prefixes of the run. If the limit does not exist, then the vector is undefined. We show that for onecounter pVASS, the pattern frequency vector is defined and takes one of finitely many values for almost all runs. Further, these values and their associated probabilities can be approximated up to an arbitrarily small relative error in polynomial time. For stable twocounter pVASS, we show the same result, but we do not provide any upper complexity bound. As a byproduct of our study, we discover counterexamples falsifying some classical results about stochastic Petri nets published in the 80s.
Suggested BibTeX entry:
@inproceedings{15BKKNLICS,
address = {Kyoto, Japan},
author = {Tom\'a\v{s} Br\'azdil and Stefan Kiefer and Anton\'in Ku\v{c}era and Petr Novotn\'y},
booktitle = {Proceedings of the 30th Annual Symposium on Logic in Computer Science (LICS)},
pages = {4455},
publisher = {IEEE},
title = {LongRun Average Behaviour of Probabilistic Vector Addition Systems},
year = {2015}
}




