Computing Game Values for Crash Games

DOI10.1007/978-3-540-75596-8_14MaRDI QIDQ3510795zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• Automated Technology for Verification and Analysis
• Computer Aided Verification
• CONCUR 2005 – Concurrency Theory
• scientific article; zbMATH DE number 1670778 (Why is no real title available?)
• scientific article; zbMATH DE number 3148886 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• Mathematical Foundations of Computer Science 2004
• On Nonterminating Stochastic Games
• Perspectives of System Informatics
• Polynomial Precise Interval Analysis Revisited
• Precise Fixpoint Computation Through Strategy Iteration
• Rudiments of \(\mu\)-calculus

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)