Mean-payoff pushdown games

DOI10.1109/LICS.2012.30MaRDI QIDQ2986796zbMATH OpenOpenAlexWikidataFDO

Authors Krishnendu Chatterjee, Yaron Velner

Publication date 16 May 2017

Published in 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/lics.2012.30

zbMATH Keywords

games on graphsmean-payoff objectivespushdown automatapushdown games

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43)

Recommendations

• The complexity of mean-payoff pushdown games
• Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
• Visibly pushdown modular games
• Modular strategies for recursive game graphs
• scientific article; zbMATH DE number 2086664

Cited in

(13)

• Hyperplane separation technique for multidimensional mean-payoff games
• Modular strategies for recursive game graphs
• Average-energy games
• Bounding Average-Energy Games
• Graph Games and Reactive Synthesis
• scientific article; zbMATH DE number 1956593 (Why is no real title available?)
• The complexity of mean-payoff pushdown games
• scientific article; zbMATH DE number 2086664 (Why is no real title available?)
• Visibly pushdown modular games
• Optimal strategies in pushdown reachability games
• Average stack cost of Büchi pushdown automata
• Visibly pushdown modular games
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Mean-payoff pushdown games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986796)