An Algorithm for Probabilistic Alternating Simulation

DOI10.1007/978-3-642-27660-6_35zbMath1302.68205arXiv1106.1978OpenAlexW2131974260MaRDI QIDQ2891387

Chenyi Zhang, Jun Pang

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1106.1978

Mathematics Subject Classification ID

Applications of game theory (91A80) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Automatic verification of competitive stochastic systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• From bisimulation to simulation: Coarsest partition problems
• Quantitative solution of omega-regular games
• Deciding bisimilarity and similarity for probabilistic processes.
• Concurrent reachability games
• Algorithms for Game Metrics
• On Probabilistic Alternating Simulations
• Alternating-time temporal logic
• Correcting a Space-Efficient Simulation Algorithm
• Game Refinement Relations and Metrics
• A Space-Efficient Probabilistic Simulation Algorithm
• The complexity of quantitative concurrent parity games
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Simulation-based minimization
• Stochastic Games
• CONCUR 2003 - Concurrency Theory

This page was built for publication: An Algorithm for Probabilistic Alternating Simulation