On the Complexity of the Equivalence Problem for Probabilistic Automata
Deciding equivalence of probabilistic automata is a key problem for establishing various behavioural and anonymity properties of probabilistic systems. In recent experiments a randomised equivalence test based on polynomial identity testing outperformed deterministic algorithms. In this paper we sho...
| Autores principales: | , , , , |
|---|---|
| Formato: | Journal article |
| Lenguaje: | English |
| Publicado: |
2012
|