{"type":"technical_report","related_material":{"record":[{"status":"public","id":"2957","relation":"later_version"}]},"publication_status":"published","day":"11","oa_version":"Published Version","date_updated":"2023-02-23T11:05:53Z","oa":1,"page":"30","publication_identifier":{"issn":["2664-1690"]},"file_date_updated":"2020-07-14T12:46:40Z","year":"2011","alternative_title":["IST Austria Technical Report"],"has_accepted_license":"1","publisher":"IST Austria","status":"public","_id":"5384","date_created":"2018-12-12T11:39:01Z","pubrep_id":"20","doi":"10.15479/AT:IST-2011-0004","file":[{"file_id":"5545","relation":"main_file","checksum":"f5a0f664fadc335990f5fcf138df19f1","content_type":"application/pdf","access_level":"open_access","creator":"system","file_name":"IST-2011-004_IST-2011-0004.pdf","date_updated":"2020-07-14T12:46:40Z","file_size":570827,"date_created":"2018-12-12T11:54:23Z"}],"abstract":[{"text":"We consider probabilistic automata on infinite words with acceptance defined by parity conditions. We consider three qualitative decision problems: (i) the positive decision problem asks whether there is a word that is accepted with positive probability; (ii) the almost decision problem asks whether there is a word that is accepted with probability 1; and (iii) the limit decision problem asks whether for every ε > 0 there is a word that is accepted with probability at least 1 − ε. We unify and generalize several decidability results for probabilistic automata over infinite words, and identify a robust (closed under union and intersection) subclass of probabilistic automata for which all the qualitative decision problems are decidable for parity conditions. We also show that if the input words are restricted to lasso shape words, then the positive and almost problems are decidable for all probabilistic automata with parity conditions.","lang":"eng"}],"date_published":"2011-04-11T00:00:00Z","citation":{"ama":"Chatterjee K, Tracol M. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria; 2011. doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">10.15479/AT:IST-2011-0004</a>","apa":"Chatterjee, K., &#38; Tracol, M. (2011). <i>Decidable problems for probabilistic automata on infinite words</i>. IST Austria. <a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">https://doi.org/10.15479/AT:IST-2011-0004</a>","chicago":"Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria, 2011. <a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">https://doi.org/10.15479/AT:IST-2011-0004</a>.","ieee":"K. Chatterjee and M. Tracol, <i>Decidable problems for probabilistic automata on infinite words</i>. IST Austria, 2011.","ista":"Chatterjee K, Tracol M. 2011. Decidable problems for probabilistic automata on infinite words, IST Austria, 30p.","short":"K. Chatterjee, M. Tracol, Decidable Problems for Probabilistic Automata on Infinite Words, IST Austria, 2011.","mla":"Chatterjee, Krishnendu, and Mathieu Tracol. <i>Decidable Problems for Probabilistic Automata on Infinite Words</i>. IST Austria, 2011, doi:<a href=\"https://doi.org/10.15479/AT:IST-2011-0004\">10.15479/AT:IST-2011-0004</a>."},"ddc":["000","005"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"title":"Decidable problems for probabilistic automata on infinite words","month":"04","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Tracol","full_name":"Tracol, Mathieu","first_name":"Mathieu","id":"3F54FA38-F248-11E8-B48F-1D18A9856A87"}]}