Stochastic Games with Lossy Channels

DOI10.1007/978-3-540-78499-9_4zbMath1138.91336MaRDI QIDQ5458349

Luca de Alfaro, Noomene Ben Henda, Sven Sandberg, Richard Mayr, Parosh Aziz Abdulla

Publication date: 11 April 2008

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78499-9_4

Mathematics Subject Classification ID

91A43: Games involving graphs

91A15: Stochastic games, stochastic differential games

90C40: Markov and semi-Markov decision processes

Related Items

Stochastic Games with Lossy Channels, Probabilistic total store ordering, Qualitative reachability in stochastic BPA games, Computable fixpoints in well-structured symbolic model checking

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of stochastic games
• Infinite games on finitely coloured graphs with applications to automata on infinite trees
• Verifying lossy channel systems has nonprimitive recursive complexity.
• Verifying programs with unreliable channels
• Eager Markov Chains
• Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
• Computer Science Logic
• Computer Science Logic
• Model Checking Probabilistic Pushdown Automata
• On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems
• Stochastic Games with Lossy Channels
• Automata, Languages and Programming
• Automata, Languages and Programming
• Ordering by Divisibility in Abstract Algebras
• Stochastic Games