Verifying systems of resource-bounded agents

Natasha Alechina*, Brian Logan

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference Article in proceedingAcademicpeer-review

Abstract

Approaches to the verification of multi-agent systems are typically based on games or transition systems defined in terms of states and actions. However such approaches often ignore a key aspect of multiagent systems, namely that the agents’ actions require (and sometimes produce) resources.We briefly survey previous work on the verification of multi-agent systems that takes resources into account, and outline some key challenges for future work.

Original languageEnglish
Title of host publicationPursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Proceedings
EditorsNataša Jonoska, Laurent Bienvenu, Arnold Beckmann
PublisherSpringer Verlag
Pages3-12
Number of pages10
ISBN (Print)9783319401881
DOIs
Publication statusPublished - 2016
Externally publishedYes
Event12th Conference on Computability in Europe, CiE 2016 - Paris, France
Duration: 27 Jun 20161 Jul 2016

Publication series

SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9709
ISSN0302-9743

Conference

Conference12th Conference on Computability in Europe, CiE 2016
Abbreviated titleCiE 2016
Country/TerritoryFrance
CityParis
Period27/06/161/07/16

Fingerprint

Dive into the research topics of 'Verifying systems of resource-bounded agents'. Together they form a unique fingerprint.

Cite this