Affiliation:
1. Technische Universität Dresden, Germany
2. INRIA Rennes Bretagne Atlantique, France
Abstract
Probabilistic ω-automata are variants of nondeterministic automata over infinite words where all choices are resolved by probabilistic distributions. Acceptance of a run for an infinite input word can be defined using traditional acceptance criteria for ω-automata, such as Büchi, Rabin or Streett conditions. The accepted language of a probabilistic ω-automata is then defined by imposing a constraint on the probability measure of the accepting runs. In this paper, we study a series of fundamental properties of probabilistic ω-automata with three different language-semantics: (1) the probable semantics that requires positive acceptance probability, (2) the almost-sure semantics that requires acceptance with probability 1, and (3) the threshold semantics that relies on an additional parameter λ ∈ ]0,1[ that specifies a lower probability bound for the acceptance probability. We provide a comparison of probabilistic ω-automata under these three semantics and nondeterministic ω-automata concerning expressiveness and efficiency. Furthermore, we address closure properties under the Boolean operators union, intersection and complementation and algorithmic aspects, such as checking emptiness or language containment.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Stochastic Games with Synchronization Objectives;Journal of the ACM;2023-05-23
2. Formal Methods for Autonomous Systems;Foundations and Trends® in Systems and Control;2023
3. Robust Almost-Sure Reachability in Multi-Environment MDPs;Tools and Algorithms for the Construction and Analysis of Systems;2023
4. Stochastic Games with Synchronizing Objectives;Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science;2022-08-02
5. Gradient-Descent for Randomized Controllers Under Partial Observability;Lecture Notes in Computer Science;2022