Lattice structures for bisimilar Probabilistic Automata

Autor:	Schuster, Johann, Siegle, Markus
Rok vydání:	2014
Předmět:	Computer Science - Formal Languages and Automata Theory Computer Science - Logic in Computer Science
Zdroj:	EPTCS 140, 2014, pp. 1-15
Druh dokumentu:	Working Paper
DOI:	10.4204/EPTCS.140.1
Popis:	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. Comment: In Proceedings INFINITY 2013, arXiv:1402.6610
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1402.6782 Zobrazit plný text záznamu View this record from Arxiv