Formal languages
Handbook of theoretical computer science (vol. B)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Theoretical issues in the design and verification of distributed systems
Theoretical issues in the design and verification of distributed systems
Recognizing ?-regular Languages with Probabilistic Automata
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)
Introduction to probabilistic automata (Computer science and applied mathematics)
On the Expressiveness and Complexity of Randomization in Finite State Monitors
LICS '08 Proceedings of the 2008 23rd Annual IEEE Symposium on Logic in Computer Science
Reasoning about infinite computation paths
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On the complexity of space bounded interactive proofs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On the expressiveness and complexity of randomization in finite state monitors
Journal of the ACM (JACM)
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
The Effect of Tossing Coins in Omega-Automata
CONCUR 2009 Proceedings of the 20th International Conference on Concurrency Theory
Probabilistic automata on finite words: decidable and undecidable problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Qualitative analysis of partially-observable Markov decision processes
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
On model checking techniques for randomized distributed systems
IFM'10 Proceedings of the 8th international conference on Integrated formal methods
Probabilistic Büchi automata with non-extremal acceptance thresholds
VMCAI'11 Proceedings of the 12th international conference on Verification, model checking, and abstract interpretation
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
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
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 survey of partial-observation stochastic parity games
Formal Methods in System Design
| Hi-index | 0.01 |
Probabilistic Büchi Automata (PBA) are randomized, finite state automata that process input strings of infinite length. Based on the threshold chosen for the acceptance probability, different classes of languages can be defined. In this paper, we present a number of results that clarify the power of such machines and properties of the languages they define. The broad themes we focus on are as follows. We precisely characterize the complexity of the emptiness, universality, and language containment problems for such machines, answering canonical questions central to the use of these models in formal verification. Next, we characterize the languages recognized by PBAs topologically, demonstrating that though general PBAs can recognize languages that are not regular, topologically the languages are as simple as *** -regular languages. Finally, we introduce Hierarchical PBAs, which are syntactically restricted forms of PBAs that are tractable and capture exactly the class of *** -regular languages.