Game characterization of probabilistic bisimilarity, and applications to pushdown automata
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof. Our definition of pPDA allows both probabilistic and nondeterministic branching, generalising the classical notion of pushdown automata (without epsilon-transitions). We first show a general characte...
| Asıl Yazarlar: | , , , |
|---|---|
| Materyal Türü: | Journal article |
| Baskı/Yayın Bilgisi: |
International Federation of Computational Logic
2018
|