A Compositional Automata-based Approach for Model Checking Multi-Agent Systems

Authors:
Mario Benevides;Carla Delgado;Carlos Pombo;Luis Lopes;Ricardo Ribeiro
Affiliations:
COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil;COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil;Universidad de Buenos Aires, Buenos Aires, Argentina;COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil;COPPE-Sistemas, Universidade Federal do Rio de Janeiro, Rio de Janeiro, Brazil
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2008

Citing 6
Cited 0

Reasoning about knowledge

Reasoning about knowledge
The temporal logic of branching time

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Alternating-time temporal logic

Journal of the ACM (JACM)
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic

Logic of Programs, Workshop
Knowledge, common knowledge and related puzzles (Extended Summary)

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Verification of Multiagent Systems via Unbounded Model Checking

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the issue of model checking knowledge in concurrent systems. The work benefits from many recent results on model checking and combined logics for time and knowledge, and focus on the way knowledge relations can be captured from automata-based system specifications. We present a formal language with compositional semantics and the corresponding Model Checking algorithms to model and verify Multi-Agent Systems (MAS) at the knowledge level, and a process for obtaining the global automaton for the concurrent system and the knowledge relations for each agent from a set of local automata that represents the behavior of each agent. Our aim is to describe a model suitable for model checking knowledge in a pre-defined way, but with the advantage that the knowledge relations for this would be extracted directly from the automata-based model.