Quantitative fair simulation games

DOI10.1016/J.IC.2016.10.006MaRDI QIDQ528184zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Thomas A. Henzinger, Jan Otop, Yaron Velner

Publication date 12 May 2017

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2016.10.006

zbMATH Keywords

simulationweighted automatamean-payoff gamesdiscounted-sum gamesfair simulationquantitative simulation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80)

Recommendations

• Quantitative Languages
• Quantitative simulations by matrices
• Quantitative languages
• Buffered simulation games for Büchi automata
• Fair simulation for nondeterministic and probabilistic Büchi automata: a coalgebraic perspective

Cites work

• scientific article; zbMATH DE number 1487861 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 2209335 (Why is no real title available?)
• An \(O(n^2)\) time algorithm for alternating Büchi games
• Better Quality in Synthesis through Quantitative Objectives
• Borel determinacy
• Efficient and dynamic algorithms for alternating Büchi games and maximal end-component decomposition
• Fair simulation
• Faster algorithms for alternating refinement relations
• Half-Positional Determinacy of Infinite Games
• Hyperplane Separation Technique for Multidimensional Mean-Payoff Games
• Improved algorithms for one-pair and \(k\)-pair Streett objectives
• Mean-payoff automaton expressions
• Nested weighted automata
• Number of quantifiers is better than number of tape cells
• On the menbership problem for functional and multivalued dependencies in relational databases
• Pareto curves of multidimensional mean-payoff games
• Positional strategies for mean payoff games
• Quantitative languages
• Robust multidimensional mean-payoff games are undecidable
• Simulation distances
• Synthesis from LTL specifications with mean-payoff objectives
• Temporal specifications with accumulative values
• The complexity of mean payoff games on graphs
• The complexity of multi-mean-payoff and multi-energy games
• The complexity of stochastic games

Cited in

(10)

• On satisficing in quantitative games
• Buffered simulation games for Büchi automata
• Multi-buffer simulations for trace language inclusion
• Fair simulation for nondeterministic and probabilistic Büchi automata: a coalgebraic perspective
• Optimal repair for omega-regular properties
• Automata vs linear-programming discounted-sum inclusion
• Computing branching distances with quantitative games
• THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA
• Generic forward and backward simulations. III: Quantitative simulations by matrices
• Making weighted containment feasible: a heuristic based on simulation and abstraction

This page was built for publication: Quantitative fair simulation games

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