The complexity of probabilistic verification
Journal of the ACM (JACM)
Competitive Markov decision processes
Competitive Markov decision processes
Languages, automata, and logic
Handbook of formal languages, vol. 3
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
On the Complexity of Parity Word Automata
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Quantitative stochastic parity games
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
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
Better Quality in Synthesis through Quantitative Objectives
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
One-counter Markov decision processes
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Energy and mean-payoff parity markov decision processes
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |
In this paper we survey results of two-player games on graphs and Markov decision processes with parity, mean-payoff and energy objectives, and the combination of mean-payoff and energy objectives with parity objectives. These problems have applications in verification and synthesis of reactive systems in resource-constrained environments.