Playing games with counter automata

Authors:
Antonín Kučera
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Czech Republic
Venue:
RP'12 Proceedings of the 6th international conference on Reachability Problems
Year:
2012

Citing 21
Cited 0

The complexity of stochastic games

Information and Computation
Competitive Markov decision processes

Competitive Markov decision processes
Finitely additive stochastic games with Borel measurable payoffs

International Journal of Game Theory
The complexity of bisimilarity-checking for one-counter processes

Theoretical Computer Science
Reachability in recursive Markov decision processes

Information and Computation
Recursive Stochastic Games with Positive Rewards

ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Infinite Runs in Weighted Timed Automata with Energy Constraints

FORMATS '08 Proceedings of the 6th international conference on Formal Modeling and Analysis of Timed Systems
Stochastic games with lossy channels

FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
One-counter Markov decision processes

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Reachability games on extended vector addition systems with states

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Energy parity games

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Z-reachability problem for games on 2-dimensional vector addition systems with states is in P

RP'10 Proceedings of the 4th international conference on Reachability problems
Approximating the termination value of one-counter MDPS and stochastic games

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Energy and mean-payoff parity markov decision processes

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Energy games in multiweighted automata

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems

LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Efficient qualitative analysis of classes of recursive markov decision processes and simple stochastic games

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Recursive concurrent stochastic games

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Recursive markov decision processes and recursive stochastic games

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Minimizing expected termination time in one-counter markov decision processes

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Efficient controller synthesis for consumption games with multiple resource types

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

We survey recent results about subclasses of multi-counter games that are either equipped with more than one counter or allow for stochastic control states.