Publication

A survey of stochastic omega-regular games

Thomas Henzinger
2012
Journal Articles

Abstract

We summarize classical and recent results about two-player games played on graphs with omega-regular objectives. These games have applications in the verification and synthesis of reactive systems. Important distinctions are whether a graph game is turn-based or concurrent; deterministic or stochastic; zero-sum or not. We cluster known results and open problems according to these classifications. (C) 2011 Elsevier Inc. All rights reserved.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A survey of stochastic omega-regular games

Chat with Graph Search

Integer points in the degree-sequence polytope

Generalised Implicit Neural Representations

Learning Over Multitask Graphs-Part I: Stability Analysis