. "10"^^ . . . . "Br\u00E1zdil, Tom\u00E1\u0161" . "RIV/00216224:14330/14:00074099" . "57315" . "Kiefer, Stefan" . . "V\u00EDde\u0148" . "5"^^ . "P(GPP202/12/P612)" . "We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter 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 zero-reachability 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 zero-reaching 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."@en . . "Zero-reachability in probabilistic multi-counter automata" . "markov chains; petri nets; reachability; multicounter automata"@en . "We study the qualitative and quantitative zero-reachability problem in probabilistic multi-counter 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 zero-reachability 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 zero-reaching 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." . . . . "[CE7671FEECC8]" . "3"^^ . "Zero-reachability in probabilistic multi-counter automata" . . "Zero-reachability in probabilistic multi-counter automata"@en . . . . "RIV/00216224:14330/14:00074099!RIV15-GA0-14330___" . . "Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)" . "14330" . "Zero-reachability in probabilistic multi-counter automata"@en . "2014-01-01+01:00"^^ . "9781450328869" . . "Novotn\u00FD, Petr" . . "10.1145/2603088.2603161" . "ACM" . "Ku\u010Dera, Anton\u00EDn" . . . "Katoen, Joost-Pieter" . "New York" . .