Similar Items: Decision Questions for Probabilistic Automata on Small Alphabets
- An Application of the Feferman-Vaught Theorem to Automata and Logics for Words over an Infinite Alphabet
- Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
- Refinement and Difference for Probabilistic Automata
- Model Checking Probabilistic Pushdown Automata
- Cost Preserving Bisimulations for Probabilistic Automata
- High-level Counterexamples for Probabilistic Automata