Verifying systems of resource-bounded agents

Alechina, Natasha; Logan, Brian

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 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.

Citation

Alechina, N., & Logan, B. (2016). Verifying systems of resource-bounded agents. Lecture Notes in Artificial Intelligence, 9709, 3-12. https://doi.org/10.1007/978-3-319-40189-8_1

• Journal Article Type: Article
• Acceptance Date: Apr 12, 2016
• Publication Date: Jun 14, 2016
• Deposit Date: Jun 28, 2016
• Publicly Available Date: Jun 28, 2016
• Journal: Lecture Notes in Computer Science
• Electronic ISSN: 0302-9743
• Publisher: Springer Verlag
• Peer Reviewed: Peer Reviewed
• Volume: 9709
• Pages: 3-12
• Book Title: Pursuit of the Universal
• DOI: https://doi.org/10.1007/978-3-319-40189-8_1
• Public URL: https://nottingham-repository.worktribe.com/output/795188
• Publisher URL: http://link.springer.com/chapter/10.1007/978-3-319-40189-8_1
• Additional Information: The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-40189-8_1.; ; Part of: 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, proceedings.