Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1206161, author = {Brázdil, Tomáš and Kiefer, Stefan and Kučera, Antonín and Novotný, Petr and Katoen, JoostandPieter}, address = {New York}, booktitle = {Proceedings of the Joint Meeting of the TwentyThird EACSL Annual Conference on Computer Science Logic (CSL) and the TwentyNinth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}, doi = {http://dx.doi.org/10.1145/2603088.2603161}, editor = {Thomas Henzinger and Dale Miller}, keywords = {markov chains; petri nets; reachability; multicounter automata}, howpublished = {elektronická verze "online"}, language = {eng}, location = {New York}, isbn = {9781450328869}, pages = {nestránkováno}, publisher = {ACM}, title = {Zeroreachability in probabilistic multicounter automata}, url = {http://arxiv.org/abs/1401.6840}, year = {2014} }
TY  JOUR ID  1206161 AU  Brázdil, Tomáš  Kiefer, Stefan  Kučera, Antonín  Novotný, Petr  Katoen, JoostPieter PY  2014 TI  Zeroreachability in probabilistic multicounter automata PB  ACM CY  New York SN  9781450328869 KW  markov chains KW  petri nets KW  reachability KW  multicounter automata UR  http://arxiv.org/abs/1401.6840 N2  We study the qualitative and quantitative zeroreachability problem in probabilistic multicounter systems. We identify the undecidable variants of the problems, and then we concentrate on the remaining two cases. In the first case, when we are interested in the probability of all runs that visit zero in some counter, we show that the qualitative zeroreachability is decidable in time which is polynomial in the size of a given pMC and doubly exponential in the number of counters. Further, we show that the probability of all zeroreaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 in time which is polynomial in log(epsilon), exponential in the size of a given pMC, and doubly exponential in the number of counters. In the second case, we are interested in the probability of all runs that visit zero in some counter different from the last counter. Here we show that the qualitative zeroreachability is decidable and SquareRootSumhard, and the probability of all zeroreaching runs can be effectively approximated up to an arbitrarily small given error epsilon > 0 (these result applies to pMC satisfying a suitable technical condition that can be verified in polynomial time). The proof techniques invented in the second case allow to construct counterexamples for some classical results about ergodicity in stochastic Petri nets. ER 
BRÁZDIL, Tomáš, Stefan KIEFER, Antonín KUČERA, Petr NOVOTNÝ and JoostPieter KATOEN. Zeroreachability in probabilistic multicounter automata. In Thomas Henzinger and Dale Miller. \textit{Proceedings of the Joint Meeting of the TwentyThird EACSL Annual Conference on Computer Science Logic (CSL) and the TwentyNinth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)}. New York: ACM, 2014. p.~nestránkováno, 10 pp. ISBN~9781450328869. doi:10.1145/2603088.2603161.
