What is Decidable about Partially Observable Markov Decision Processes with omega-Regular Objectives

Abstract

We consider partially observable Markov decision processes (POMDPs) with ω-regular conditions specified as parity objectives. The class of ω-regular languages extends regular languages to infinite strings and provides a robust specification language to express all properties used in verification, and parity objectives are canonical forms to express… (More)
DOI: 10.4230/LIPIcs.CSL.2013.165

Topics

6 Figures and Tables

Statistics

0102030201520162017
Citations per Year

Citation Velocity: 10

Averaging 10 citations per year over the last 3 years.

Learn more about how we calculate this metric in our FAQ.

Slides referencing similar topics