"Stra\u017Eovsk\u00FD, Old\u0159ich" . . . "14330" . "3"^^ . "RIV/00216224:14330/08:00025864" . . "Deciding probabilistic bisimilarity over infinite-state probabilistic systems" . . "Ku\u010Dera, Anton\u00EDn" . . . "0001-5903" . "3"^^ . "Deciding probabilistic bisimilarity over infinite-state probabilistic systems" . "RIV/00216224:14330/08:00025864!RIV10-MSM-14330___" . "45" . "Br\u00E1zdil, Tom\u00E1\u0161" . "probabilistic bisimilarity; infinite-state systems"@en . "24"^^ . . "362265" . "Deciding probabilistic bisimilarity over infinite-state probabilistic systems"@en . . . "000254400600003" . "DE - Spolkov\u00E1 republika N\u011Bmecko" . . . . . "We prove that probabilistic bisimilarity is decidable over probabilistic extensions of BPA and BPP processes. For normed subclasses of probabilistic BPA and BPP processes we obtain polynomial-time algorithms. Further, we show that probabilistic bisimilarity between probabilistic pushdown automata and finite-state systems is decidable in exponential time. If the number of control states in PDA is bounded by a fixed constant, then the algorithm needs only polynomial time."@en . "2" . . "[A6A10BD3F2AF]" . "We prove that probabilistic bisimilarity is decidable over probabilistic extensions of BPA and BPP processes. For normed subclasses of probabilistic BPA and BPP processes we obtain polynomial-time algorithms. Further, we show that probabilistic bisimilarity between probabilistic pushdown automata and finite-state systems is decidable in exponential time. If the number of control states in PDA is bounded by a fixed constant, then the algorithm needs only polynomial time." . . "Deciding probabilistic bisimilarity over infinite-state probabilistic systems"@en . "P(1M0545), Z(MSM0021622419)" . . . "Acta informatica" . .