Lattice structures for bisimilar Probabilistic Automata
Formal Languages and Automata Theory
2014-02-28 v1 Logic in Computer Science
Abstract
The paper shows that there is a deep structure on certain sets of bisimilar Probabilistic Automata (PA). The key prerequisite for these structures is a notion of compactness of PA. It is shown that compact bisimilar PA form lattices. These results are then used in order to establish normal forms not only for finite automata, but also for infinite automata, as long as they are compact.
Keywords
Cite
@article{arxiv.1402.6782,
title = {Lattice structures for bisimilar Probabilistic Automata},
author = {Johann Schuster and Markus Siegle},
journal= {arXiv preprint arXiv:1402.6782},
year = {2014}
}
Comments
In Proceedings INFINITY 2013, arXiv:1402.6610