Computing Game Values for Crash Games

DOI10.1007/978-3-540-75596-8_14zbMATH Open1141.91345OpenAlexW1487087108MaRDI QIDQ3510795FDOQ3510795

Authors: Thomas Martin Gawlitza, Helmut Seidl 

Publication date: 3 July 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_14

Recommendations

• Solving counter parity games
• The complexity of mean payoff games on graphs
• Termination criteria for solving concurrent safety and reachability games
• scientific article; zbMATH DE number 1670778
• Algorithms for solving parity games

Mathematics Subject Classification ID

2-person games (91A05) Games involving graphs (91A43)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Automated Technology for Verification and Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Nonterminating Stochastic Games
• Computer Aided Verification
• Precise Fixpoint Computation Through Strategy Iteration
• Perspectives of System Informatics
• Rudiments of \(\mu\)-calculus
• Mathematical Foundations of Computer Science 2004
• CONCUR 2005 – Concurrency Theory
• Polynomial Precise Interval Analysis Revisited

Cited In (2)

• Model checking games for the quantitative \(\mu \)-calculus
• Model checking the quantitative \(\mu \)-calculus on linear hybrid systems

This page was built for publication: Computing Game Values for Crash Games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510795)