Solving Parity Games on Integer Vectors

DOI10.1007/978-3-642-40184-8_9zbMath1390.68452arXiv1306.2806OpenAlexW1866572553MaRDI QIDQ2842100

Arnaud Sangnier, Jeremy Sproston, Richard Mayr, Parosh Aziz Abdulla

Publication date: 12 August 2013

Published in: CONCUR 2013 – Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.2806

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (11)

State of the Art in Logics for Verification of Resource-Bounded Multi-Agent Systems ⋮ Fixed-Dimensional Energy Games are in Pseudo-Polynomial Time ⋮ Nonelementary Complexities for Branching VASS, MELL, and Extensions ⋮ Unnamed Item ⋮ Realizability problem for constraint LTL ⋮ Simple stochastic games with almost-sure energy-parity objectives are in NP and conp ⋮ Strategic reasoning with a bounded number of resources: the quest for tractability ⋮ On decidability and complexity of low-dimensional robot games ⋮ On the complexity of resource-bounded logics ⋮ Playing with Repetitions in Data Words Using Energy Games ⋮ Qualitative Analysis of VASS-Induced MDPs

This page was built for publication: Solving Parity Games on Integer Vectors