Verifying systems of resource-bounded agents

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 multi-agent systems, namely that the agents’ actions require (and sometimes produce) resources. We bri...

Full description

Bibliographic Details
Main Authors: Alechina, Natasha, Logan, Brian
Format: Article
Published: Springer Verlag 2016
Online Access:https://eprints.nottingham.ac.uk/34430/
_version_ 1848794851745726464
author Alechina, Natasha
Logan, Brian
author_facet Alechina, Natasha
Logan, Brian
author_sort Alechina, Natasha
building Nottingham Research Data Repository
collection Online Access
description 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 multi-agent 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.
first_indexed 2025-11-14T19:22:46Z
format Article
id nottingham-34430
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T19:22:46Z
publishDate 2016
publisher Springer Verlag
recordtype eprints
repository_type Digital Repository
spelling nottingham-344302020-05-04T17:56:40Z https://eprints.nottingham.ac.uk/34430/ Verifying systems of resource-bounded agents Alechina, Natasha Logan, Brian 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 multi-agent 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. Springer Verlag 2016-06-14 Article PeerReviewed Alechina, Natasha and Logan, Brian (2016) Verifying systems of resource-bounded agents. Lecture Notes in Computer Science, 9709 . pp. 3-12. ISSN 0302-9743 http://link.springer.com/chapter/10.1007/978-3-319-40189-8_1 doi:10.1007/978-3-319-40189-8_1 doi:10.1007/978-3-319-40189-8_1
spellingShingle Alechina, Natasha
Logan, Brian
Verifying systems of resource-bounded agents
title Verifying systems of resource-bounded agents
title_full Verifying systems of resource-bounded agents
title_fullStr Verifying systems of resource-bounded agents
title_full_unstemmed Verifying systems of resource-bounded agents
title_short Verifying systems of resource-bounded agents
title_sort verifying systems of resource-bounded agents
url https://eprints.nottingham.ac.uk/34430/
https://eprints.nottingham.ac.uk/34430/
https://eprints.nottingham.ac.uk/34430/