Weighted Distributed Systems and Their Logics
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Probabilistic Acceptors for Languages over Infinite Words
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
Information and Computation
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Power of Randomization in Automata on Infinite Strings
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Probabilistic Weighted Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
On decision problems for probabilistic Büchi automata
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Probabilistic automata on infinite words: decidability and undecidability results
ATVA'10 Proceedings of the 8th international conference on Automated technology for verification and analysis
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Recurrence and transience for finite probabilistic tables
Theoretical Computer Science
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
Infinite synchronizing words for probabilistic automata
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Journal of the ACM (JACM)
Partial-Observation Stochastic Games: How to Win When Belief Fails
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Decidable Problems for Probabilistic Automata on Infinite Words
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
Probabilistic automata and probabilistic logic
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
A probabilistic kleene theorem
ATVA'12 Proceedings of the 10th international conference on Automated Technology for Verification and Analysis
A survey of partial-observation stochastic parity games
Formal Methods in System Design
| Hi-index | 0.00 |
Probabilistic finite automata as acceptors for languages over finite words have been studied by many researchers. In this paper, we show how probabilistic automata can serve as acceptors for ?-regular languages. Our main results are that our variant of probabilistic Buchi automata (PBA) is more expressive than non-deterministic ?-automata, but a certain subclass of PBA, called uniform PBA, has exactly the power of ?-regular languages. This also holds for probabilistic ?-automata with Streett or Rabin acceptance. We show that certain ?-regular languages have uniform PBA of linear size, while any nondeterministic Streett automaton is of exponential size, and vice versa. Finally, we discuss the emptiness problem for uniform PBA and the use of PBA for the verification of Markov chains against qualitative lineartime properties.