Improving the model checking of strategies under partial observability and fairness constraints

Busard, Simon, Pecheur, Charles, Qu, Hongyang and Raimondi, Franco (2014) Improving the model checking of strategies under partial observability and fairness constraints. In: 16th International Conference on Formal Engineering Methods, ICFEM 2014, 3-5 Nov 2014, Luxembourg.

PDF - Draft pre-submission version (with author's formatting)
Download (435kB) | Preview


Reasoning about strategies has been a concern for several
years, and many extensions of Alternating-time Temporal Logic have been proposed. One extension, ATLKirF , allows the user to reason about the strategies of the agents of a system under partial observability and unconditional fairness constraints. However, the existing model-checking algorithm for ATLKirF is inefficient when the user is only interested in the satisfaction of a formula in a small subset of states, such as the set of
initial states of the system. We propose to generate fewer strategies by only focusing on partial strategies reachable from this subset of states, reducing the time needed to perform the verification. We also describe several practical improvements to further reduce the verification time and present experiments showing the practical impact of the approach.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Online ISBN: 9783319117379 Published paper appears in: Formal Methods and Software Engineering, Volume 8829 of the series Lecture Notes in Computer Science, pp 27-42, 2014
Research Areas: A. > School of Science and Technology > Computer Science
Item ID: 15132
Notes on copyright: The final publication is available at Springer via
Useful Links:
Depositing User: Franco Raimondi
Date Deposited: 23 Apr 2015 08:19
Last Modified: 04 Apr 2019 08:10

Actions (login required)

Edit Item Edit Item

Full text downloads (NB count will be zero if no full text documents are attached to the record)

Downloads per month over the past year