We prove that probabilistic bisimilarity is decidable over probabilistic extensions of BPA and BPP processes. 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.