Verifying Multi-agent Systems via Unbounded Model Checking

Kacprzak, Magdalena; Lomuscio, Alessio; Łasica, T.; Penczek, Wojciech; Szreter, Maciej

doi:10.1007/978-3-540-30960-4_13

Cited by 27 publications

(24 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Some of these proposals use existing model checkers (for example SPIN and JPF2) by translating some agent specification languages (for example MABLE and AgentSpeak) to the languages used by these model checkers [1,2,17]. Other proposals adapt some model checking techniques (for example bounded and unbounded model checking) and propose new algorithms for verifying temporal and epistemic properties [4,5,6]. Giordano and her colleagues [3] addressed the problem of specifying and verifying systems of communicating agents in a Dynamic Linear Time Temporal Logic (DLTL).…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Model checking communicative agent-based systems

Meyer

Wang

2009

Knowledge-Based Systems

View full text Add to dashboard Cite

Abstract. Model checking is a formal technique used to verify communication protocols against given properties. In this paper, we address the problem of verifying systems designed as a set of autonomous interacting agents using such a technique. These software agents are equipped with knowledge and beliefs and interact with each other according to protocols governed by a set of logical rules. We present a tableau-based model checking algorithm for these systems and provide the termination and complexity results.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Verifying these systems is becoming more and more necessary because they are increasingly used in several critical application domains, such as e-commerce, simulation, distributed collaborative systems, etc [5,6,7]. In these systems, agents are…”

Section: Introductionmentioning

confidence: 99%

Model checking communicative agent-based systems

Meyer

Wang

2009

Knowledge-Based Systems

View full text Add to dashboard Cite

show abstract

“…For example, model checking techniques have been widely applied to the verification of games stemming from the modeling of multi-agent systems. See for example [31], [33], [38], [20]. An example of model checker for multi-agent programs is CASP [9].…”

Section: B Related Workmentioning

confidence: 99%

Model Checking Nash Equilibria in MAD Distributed Systems

Mari

Melatti

Salvo

et al. 2008

2008 Formal Methods in Computer-Aided Design

View full text Add to dashboard Cite

Abstract-We present a symbolic model checking algorithm for verification of Nash equilibria in finite state mechanisms modeling Multiple Administrative Domains (MAD) distributed systems.Given a finite state mechanism, a proposed protocol for each agent and an indifference threshold for rewards, our model checker returns PASS if the proposed protocol is a Nash equilibrium (up to the given indifference threshold) for the given mechanism, FAIL otherwise. We implemented our model checking algorithm inside the NuSMV model checker and present experimental results showing its effectiveness for moderate size mechanisms.

show abstract

“…Recently, the verification of MAS has become an attractive field of research [3,9,10,19,20,24,26,25,30,33]. However, in the domain of agent communication, only few research work tried to address the verification of agent communication protocols [1,2,15,17,18,32].…”

Section: Introductionmentioning

confidence: 99%

A Tableau Method for Verifying Dialogue Game Protocols for Agent Communication

Moulin

Meyer

2006

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we propose a new tableau-based model checking technique for verifying dialogue game protocols for agent communication. These protocols are defined using our social commitment-based framework for agent communication called Commitment and Argument Network (CAN). We use a variant of CTL* (ACTL*) for specifying these protocols and the properties to be verified. This logic extends CTL* by allowing formulae to constrain actions as well as states. The verification method is based on the translation of formulae into a variant of alternating tree automata called Alternating Büchi Tableau Automata (ABTA). We propose a set of tableau rules (inference rules) for specifying this translation procedure. Unlike the model checking algorithms proposed in the literature, the algorithm that we propose in this paper allows us not only to verify if the dialogue game protocol (the model) satisfies a given property, but also if this protocol respects the tableau rules-based decomposition of the action formulae. This algorithm is an on-the-fly efficient algorithm.

show abstract

Verifying Multi-agent Systems via Unbounded Model Checking

Cited by 27 publications

References 22 publications

Model checking communicative agent-based systems

Model checking communicative agent-based systems

Model Checking Nash Equilibria in MAD Distributed Systems

A Tableau Method for Verifying Dialogue Game Protocols for Agent Communication

Contact Info

Product

Resources

About