TY - GEN

T1 - An abstraction-refinement framework for multi-agent systems

AU - Ball, Thomas

AU - Kupferman, Orna

PY - 2006

Y1 - 2006

N2 - Abstraction is a key technique for reasoning about systems with very large or even infinite state spaces. When a system is composed of reactive components, the interaction between the components is modeled by a multi-player game and verification corresponds to finding winners in the game. We describe an abstraction-refinement framework for multi-player games, with respect to specifications in the alternating μ-calculus (AMC). Our framework is based on abstract alternating transition systems (AATSs). Each agent in an AATS has transitions that over-approximate its power and transitions that under-approximate its power. We define the framework, define a 3-valued semantics for AMC formulas in an AATS, study the model-checking problem, define an abstraction preorder between AATSs, suggest a refinement procedure (in case model checking returns an indefinite answer), and study the completeness of the framework. For the case of predicate abstraction, we show how reasoning can be automated with a theorem prover. Abstractions of multi-player games have been studied in the past. Our main contribution with respect to earlier work is that we study general (rather than only turn-based) ATSs, we add a refinement procedure on top of the model checking procedure, and our abstraction preorder is parameterized by a set of agents.

AB - Abstraction is a key technique for reasoning about systems with very large or even infinite state spaces. When a system is composed of reactive components, the interaction between the components is modeled by a multi-player game and verification corresponds to finding winners in the game. We describe an abstraction-refinement framework for multi-player games, with respect to specifications in the alternating μ-calculus (AMC). Our framework is based on abstract alternating transition systems (AATSs). Each agent in an AATS has transitions that over-approximate its power and transitions that under-approximate its power. We define the framework, define a 3-valued semantics for AMC formulas in an AATS, study the model-checking problem, define an abstraction preorder between AATSs, suggest a refinement procedure (in case model checking returns an indefinite answer), and study the completeness of the framework. For the case of predicate abstraction, we show how reasoning can be automated with a theorem prover. Abstractions of multi-player games have been studied in the past. Our main contribution with respect to earlier work is that we study general (rather than only turn-based) ATSs, we add a refinement procedure on top of the model checking procedure, and our abstraction preorder is parameterized by a set of agents.

UR - http://www.scopus.com/inward/record.url?scp=34547258634&partnerID=8YFLogxK

U2 - 10.1109/LICS.2006.10

DO - 10.1109/LICS.2006.10

M3 - Conference contribution

AN - SCOPUS:34547258634

SN - 0769526314

SN - 9780769526317

T3 - Proceedings - Symposium on Logic in Computer Science

SP - 379

EP - 388

BT - Proceedings - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 21st Annual IEEE Symposium on Logic in Computer Science, LICS 2006

Y2 - 12 August 2006 through 15 August 2006

ER -