Publication details
Deciding probabilistic bisimilarity over infinite-state probabilistic systems
| Authors | |
|---|---|
| Year of publication | 2008 |
| Type | Article in Periodical |
| Magazine / Source | Acta informatica |
| MU Faculty or unit | |
| Citation | |
| Field | Informatics |
| Keywords | probabilistic bisimilarity; infinite-state systems |
| Description | 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. |
| Related projects: |