Symbolic model checking for one-resource RB±ATL
Alechina, Natasha, Logan, Brian, Nguyen, Hoang Nga and Raimondi, Franco ORCID: https://orcid.org/0000-0002-9508-7713
(2015)
Symbolic model checking for one-resource RB±ATL.
Yang, Qiang and Wooldridge, Michael, eds.
Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015).
In: 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), 25-31 Jul 2015, Buenos Aires, Argentina.
ISBN 9781577357384.
[Conference or Workshop Item]
|
PDF
- Final accepted version (with author's formatting)
Download (324kB) | Preview |
Abstract
RB±ATL is an extension of ATL where it is possible to model consumption and production of several resources by a set of agents. The model-checking problem for RB±ATL is known to be decidable. However the only available model-checking algorithm for RB±ATL uses a forward search of the state space, and hence does not have an efficient symbolic implementation. In this paper,
we consider a fragment of RB±ATL, 1RB±ATL, that allows only one resource type. We give a symbolic model-checking algorithm for this fragment of RB±ATL, and evaluate the performance of an MCMAS-based implementation of the algorithm on an example problem that can be scaled to large state spaces.
Item Type: | Conference or Workshop Item (Paper) |
---|---|
Research Areas: | A. > School of Science and Technology > Computer Science |
Item ID: | 18939 |
Useful Links: | |
Depositing User: | Franco Raimondi |
Date Deposited: | 02 Mar 2016 11:20 |
Last Modified: | 29 Nov 2022 22:35 |
URI: | https://eprints.mdx.ac.uk/id/eprint/18939 |
Actions (login required)
![]() |
View Item |
Statistics
Additional statistics are available via IRStats2.