• Keine Ergebnisse gefunden

From model checking to equilibrium checking

N/A
N/A
Protected

Academic year: 2022

Aktie "From model checking to equilibrium checking"

Copied!
1
0
0

Wird geladen.... (Jetzt Volltext ansehen)

Volltext

(1)

Heinrich C. Mayr, Martin Pinzger (Hrsg.): INFORMATIK 2016, Lecture Notes in Informatics (LNI), Gesellschaft für Informatik, Bonn 2016 35

From model checking to equilibrium checking

Michael Wooldridge1

Abstract

Equilibrium checking is concerned with establishing whether a given temporal logic formula φ is satisfied in some or all equilibrium computations of a multi-agent system – that is, whether the system will exhibit the behaviour φ under the assumption that agents within the system act rationally in pursuit of their preferences.

After motivating and introducing the framework of equilibrium checking, we present formal models through which rational verification can be studied, and survey the complexity of key decision problems. We give an overview of a prototype software tool for rational verification, and conclude with a discussion and related work.

Michael Wooldridge is a Professor in the Department of Computer Science at the University of Oxford. He has been active in multi-agent systems research since 1989, and has published over three hundred articles in the area. His main interests are in the use of formal methods for reasoning about autonomous agents and multi-agent systems.

Wooldridge is an ACM Fellow, a AAAI Fellow, an ECCAI Fellow, and a member of Academia Europaea. He was the recipient of the ACM Autonomous Agents Research Award in 2006.

1University of Oxford, Department of Computer Science, mjw@cs.ox.ac.uk

Referenzen

ÄHNLICHE DOKUMENTE

According to condition AC 1 it is necessary to know that there exists a coun- terexample trace which leads to the violation of the considered non-reachability property. In addition,

According to condition AC 1 it is necessary to know that there exists a coun- terexample trace which leads to the violation of the considered non-reachability property. In addition,

Our algorithm uses less information about the Markov chain than previous algorithms that provide confidence bounds for unbounded properties—we need to know only the minimum

[r]

These examples suggest that the Solow residual controls the entire path of aggregate output if redefine more broadly to include financial distributional and institutional

 Model-checking allows us to show to show properties of systems by enumerating the system’s states, by modelling systems as finite state machines, and expressing properties

The basic problem: the system state can quickly get huge, and the basic complexity of the problem is horrendous, leading to so-called state explosion. But the use of abstraction

Spin translates the automata into a C program, which performs the actual model-checking. Supports LTL