Lattice structures for bisimilar Probabilistic Automata

Johann Schuster
(University of the Federal Armed Forces Munich Neubiberg, Germany)
Markus Siegle
(University of the Federal Armed Forces Munich Neubiberg, Germany)

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.

In Lukas Holik and Lorenzo Clemente: Proceedings 15th International Workshop on Verification of Infinite-State Systems (INFINITY 2013), Hanoi, Vietnam, 14th October 2013, Electronic Proceedings in Theoretical Computer Science 140, pp. 1–15.
Published: 23rd February 2014.

ArXived at: http://dx.doi.org/10.4204/EPTCS.140.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org