Conditionally Optimal Algorithms for Generalized Büchi Games

Games on graphs provide the appropriate framework to study several central problems in computer science, such as the verification and synthesis of reactive systems. One of the most basic objectives for games on graphs is the liveness (or B\"uchi) objective that given a target set of vertices re...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Chatterjee, Krishnendu, Dvořák, Wolfgang, Henzinger, Monika, Loitzenbauer, Veronika
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 20.07.2016
Subjects:	Algorithms Apexes Boolean algebra Combinatorial analysis Games Graph theory Graphs Lower bounds Multiplication Objectives Program verification (computers) Run time (computers)
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!