Earlier Version
Probabilistic automata on infinite words: Decidability and undecidability results
Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.
Download
Technical Report
| Published
| English
Author
Department
Series Title
IST Austria Technical Report
Abstract
We consider probabilistic automata on infinite words with acceptance defined by safety, reachability, Büchi, coBüchi and limit-average conditions. We consider quantitative and qualitative decision problems. We present extensions and adaptations of proofs of [GO09] and present a precise characterization of the decidability and undecidability frontier of the quantitative and qualitative decision problems.
Publishing Year
Date Published
2009-11-02
Page
17
ISSN
IST-REx-ID
Cite this
Chatterjee K. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria; 2009. doi:10.15479/AT:IST-2009-0004
Chatterjee, K. (2009). Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria. https://doi.org/10.15479/AT:IST-2009-0004
Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009. https://doi.org/10.15479/AT:IST-2009-0004.
K. Chatterjee, Probabilistic automata on infinite words: Decidability and undecidability results. IST Austria, 2009.
Chatterjee K. 2009. Probabilistic automata on infinite words: Decidability and undecidability results, IST Austria, 17p.
Chatterjee, Krishnendu. Probabilistic Automata on Infinite Words: Decidability and Undecidability Results. IST Austria, 2009, doi:10.15479/AT:IST-2009-0004.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Main File(s)
File Name
IST-2009-0004_IST-2009-0004.pdf
311.06 KB
Access Level
Open Access
Date Uploaded
2018-12-12
MD5 Checksum
fb7563150231325b00b1718d956f687b
Material in ISTA:
Later Version
Google Scholar