Reasoning about Equilibria in Game-like Concurrent Systems

Abstract
Our aim is to develop techniques for reasoning about game-like concurrent systems, where the components of the system act rationally and strategically in pursuit of logically specified goals. We first present a computational model for such systems, and investigate its properties. We then define and investigate a branching-time logic for reasoning about the equilibrium properties of such systems. The key operator in this logic is a path quantifier [NE]phi, which asserts that phi holds on all Nash equilibrium computations of the system.