Probabilistic ω-automata

DOI10.1145/2108242.2108243zbMath1281.68152OpenAlexW2135776689MaRDI QIDQ5395674

Nathalie Bertrand, Marcus Größer, Christel Baier

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2108242.2108243

zbMATH Keywords

Markov decision processesBüchi automataprobabilistic automata\(\omega\)-regular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (18)

What is decidable about partially observable Markov decision processes with \(\omega\)-regular objectives ⋮ Measure Quantifier in Monadic Second Order Logic ⋮ Enforcing almost-sure reachability in POMDPs ⋮ Gradient-descent for randomized controllers under partial observability ⋮ Finite-Memory Strategies in POMDPs with Long-Run Average Objectives ⋮ Randomization in Automata on Infinite Trees ⋮ Parameter-Independent Strategies for pMDPs via POMDPs ⋮ Ambiguity, weakness, and regularity in probabilistic Büchi automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Probabilistic opacity for Markov decision processes ⋮ Unnamed Item ⋮ Decidable and expressive classes of probabilistic automata ⋮ The complexity of synchronizing Markov decision processes ⋮ Distributed Synthesis in Continuous Time ⋮ Monadic Second Order Logic with Measure and Category Quantifiers ⋮ Qualitative analysis of concurrent mean-payoff games ⋮ Task-Aware Verifiable RNN-Based Policies for Partially Observable Markov Decision Processes

This page was built for publication: Probabilistic ω-automata