On Decision Problems for Probabilistic Büchi Automata

DOI10.1007/978-3-540-78499-9_21zbMath1139.68030MaRDI QIDQ5458366

Christel Baier, Marcus Größer, Nathalie Bertrand

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_21

Mathematics Subject Classification ID

68Q45: Formal languages and automata

03D35: Undecidability and degrees of sets of sentences

Related Items

Power of Randomization in Automata on Infinite Strings, Recurrence and transience for finite probabilistic tables, Probabilistic Büchi Automata with Non-extremal Acceptance Thresholds, The Effect of Tossing Coins in Omega-Automata, Probabilistic Weighted Automata, Probabilistic Acceptors for Languages over Infinite Words, Weighted versus Probabilistic Logics

Uses Software

• POMDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of two-player games of incomplete information
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Automata, logics, and infinite games. A guide to current research
• Quantitative Model Checking Revisited: Neither Decidable Nor Approximable
• The complexity of probabilistic verification
• Termination of Probabilistic Concurrent Program
• Computer Aided Verification
• Probabilistic automata