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.
|Journal Article Type||Article|
|Publication Date||Jun 14, 2016|
|Journal||Lecture Notes in Computer Science|
|Peer Reviewed||Peer Reviewed|
|Book Title||Pursuit of the Universal|
|APA6 Citation||Alechina, N., & Logan, B. (2016). Verifying systems of resource-bounded agents. Lecture Notes in Artificial Intelligence, 9709, https://doi.org/10.1007/978-3-319-40189-8_1|
|Copyright Statement||Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf|
|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.
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf
You might also like
Decidable Model Checking with Uniform Strategies
Strategic Responsibility Under Imperfect Information
Groups Versus Coalitions: On the Relative Expressivity of GAL and CAL
Qualitative spatial logic over 2D Euclidean spaces is not finitely axiomatisable
Model checking for Coalition Announcement Logic