Lattice structures for bisimilar Probabilistic Automata

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 not...

Full description

Bibliographic Details
Main Authors: Johann Schuster, Markus Siegle
Format: Article
Language:English
Published: Open Publishing Association 2014-02-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1402.6782v1
id doaj-9c43393f890749a9a732c8074125995e
record_format Article
spelling doaj-9c43393f890749a9a732c8074125995e2020-11-24T23:27:58ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802014-02-01140Proc. INFINITY 201311510.4204/EPTCS.140.1:1Lattice structures for bisimilar Probabilistic AutomataJohann Schuster0Markus Siegle1 University of the Federal Armed Forces Munich Neubiberg, Germany 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.http://arxiv.org/pdf/1402.6782v1
collection DOAJ
language English
format Article
sources DOAJ
author Johann Schuster
Markus Siegle
spellingShingle Johann Schuster
Markus Siegle
Lattice structures for bisimilar Probabilistic Automata
Electronic Proceedings in Theoretical Computer Science
author_facet Johann Schuster
Markus Siegle
author_sort Johann Schuster
title Lattice structures for bisimilar Probabilistic Automata
title_short Lattice structures for bisimilar Probabilistic Automata
title_full Lattice structures for bisimilar Probabilistic Automata
title_fullStr Lattice structures for bisimilar Probabilistic Automata
title_full_unstemmed Lattice structures for bisimilar Probabilistic Automata
title_sort lattice structures for bisimilar probabilistic automata
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2014-02-01
description 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.
url http://arxiv.org/pdf/1402.6782v1
work_keys_str_mv AT johannschuster latticestructuresforbisimilarprobabilisticautomata
AT markussiegle latticestructuresforbisimilarprobabilisticautomata
_version_ 1725551128447287296

Similar Items