Formal Methods for Components and Objects

DOI10.1007/11561163zbMath1143.68447OpenAlexW4298853841MaRDI QIDQ5897449

Marcin Jurdziński, Thomas A. Henzinger, Krishnendu Chatterjee

Publication date: 1 November 2006

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

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

Mathematics Subject Classification ID

Games involving graphs (91A43) Applications of game theory (91A80) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (8)

The Theory of Universal Graphs for Infinite Duration Games ⋮ Buying optimal payoffs in bi-matrix games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Robust Equilibria in Mean-Payoff Games ⋮ Reaching Your Goal Optimally by Playing at Random with No Memory

This page was built for publication: Formal Methods for Components and Objects