The complexity of stochastic games
Information and Computation
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Model checking
Algorithmic analysis of programs with well quasi-ordered domains
Information and Computation - Special issue: LICS 1996—Part 1
Concurrent Omega-Regular Games
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Strategy Improvement for Concurrent Reachability Games
QEST '06 Proceedings of the 3rd international conference on the Quantitative Evaluation of Systems
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
ACM Transactions on Computational Logic (TOCL)
Automatic verification of probabilistic concurrent finite state programs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Recursive Stochastic Games with Positive Rewards
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Verification of probabilistic systems with faulty communication
Information and Computation
Verification of probabilistic systems with faulty communication
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Model checking lossy channels systems is probably decidable
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Quantitative analysis of probabilistic lossy channel systems
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
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
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
We give an algorithm for solving stochastic parity games with almost-sure winning conditions on lossy channel systems, for the case where the players are restricted to finite-memory strategies. First, we describe a general framework, where we consider the class of $2\frac{1}{2}$-player games with almost-sure parity winning conditions on possibly infinite game graphs, assuming that the game contains a finite attractor. An attractor is a set of states (not necessarily absorbing) that is almost surely re-visited regardless of the players' decisions. We present a scheme that characterizes the set of winning states for each player. Then, we instantiate this scheme to obtain an algorithm for stochastic game lossy channel systems.