Tools and Algorithms for the Construction and Analysis of Systems

DOI10.1007/11691372MaRDI QIDQ5899063zbMATH OpenOpenAlexFDO

Authors Krishnendu Chatterjee, Thomas A. Henzinger

Publication date 2 May 2007

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11691372

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Games involving graphs (91A43) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Finitary winning in \({\omega}\)-regular games
• Faster Algorithms for Finitary Games
• Stochastic Games with Finitary Objectives
• scientific article; zbMATH DE number 2077117
• Cost-parity and cost-Streett games

Cited in

(18)

• scientific article; zbMATH DE number 7533361 (Why is no real title available?)
• From liveness to promptness
• Finitary winning in \({\omega}\)-regular games
• Graph games on ordinals
• Looking at mean-payoff and total-payoff through windows
• Parity games with weights
• On Reachability Games of Ordinal Length
• Stochastic window mean-payoff games
• Recurrence and transience for finite probabilistic tables
• Stochastic Games with Finitary Objectives
• Quantitatively fair scheduling
• Faster Algorithms for Finitary Games
• On equilibria in quantitative games with reachability/safety objectives
• Extending Finite-Memory Determinacy by Boolean Combination of Winning Conditions
• Finitary languages
• Code aware resource management
• Obliging games
• scientific article; zbMATH DE number 2077117 (Why is no real title available?)

This page was built for publication: Tools and Algorithms for the Construction and Analysis of Systems

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