The complexity of stochastic games
Information and Computation
Infinite games on finitely coloured graphs with applications to automata on infinite trees
Theoretical Computer Science
Model checking
Verifying lossy channel systems has nonprimitive recursive complexity
Information Processing Letters
Probabilistic Lossy Channel Systems
TAPSOFT '97 Proceedings of the 7th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
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
Model Checking Probabilistic Pushdown Automata
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Verifying Infinite Markov Chains with a Finite Attractor or the Global Coarseness Property
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
Decidability of the termination problem for completely specified protocols
Distributed Computing
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
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
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Recursive markov decision processes and recursive stochastic games
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Lossy counter machines decidability cheat sheet
RP'10 Proceedings of the 4th international conference on Reachability problems
Qualitative reachability in stochastic BPA games
Information and Computation
Playing games with counter automata
RP'12 Proceedings of the 6th international conference on Reachability Problems
Stochastic parity games on lossy channel systems
QEST'13 Proceedings of the 10th international conference on Quantitative Evaluation of Systems
Computable fixpoints in well-structured symbolic model checking
Formal Methods in System Design
| Hi-index | 0.01 |
We consider turn-based stochastic games on infinite graphs induced by game probabilistic lossy channel systems (GPLCS), the game version of probabilistic lossy channel systems (PLCS). We study games with Büchi (repeated reachability) objectives and almost-sure winning conditions. These games are pure memoryless determined and, under the assumption that the target set is regular, a symbolic representation of the set of winning states for each player can be effectively constructed. Thus, turn-based stochastic games on GPLCS are decidable. This generalizes the decidability result for PLCS-induced Markov decision processes in [10].