Lattice structures for bisimilar Probabilistic Automata


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 (in the sense of [4]) not only for finite automata, but also for infinite automata, as long as they are compact.

DOI: 10.4204/EPTCS.140.1

Extracted Key Phrases

2 Figures and Tables

Cite this paper

@inproceedings{Schuster2013LatticeSF, title={Lattice structures for bisimilar Probabilistic Automata}, author={Johann Schuster and Markus Siegle}, booktitle={INFINITY}, year={2013} }