The Complexity of Mean-Payoff Pushdown Games

DOI10.1145/3121408zbMath1426.68163arXiv1201.2829OpenAlexW2755538704MaRDI QIDQ4640299

Krishnendu Chatterjee, Yaron Velner

Publication date: 17 May 2018

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

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

zbMATH Keywords

synthesispushdown systemsquantitative verificationgraph gamesmean-payoff objectives

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (3)

Unnamed Item ⋮ Long-Run Average Behavior of Vector Addition Systems with States ⋮ Multi-Dimensional Long-Run Average Problems for Vector Addition Systems with States

This page was built for publication: The Complexity of Mean-Payoff Pushdown Games