Reasoning about strategies on collapsible pushdown arenas with imperfect information

by   Bastien Maubert, et al.

Strategy Logic with imperfect information (SLiR) is a very expressive logic designed to express complex properties of strategic abilities in distributed systems. Previous work on SLiR focused on finite systems, and showed that the model-checking problem is decidable when information on the control states of the system is hierarchical among the players or components of the system, meaning that the players or components can be totally ordered according to their respective knowledge of the state. We show that moving from finite to infinite systems generated by collapsible (higher-order) pushdown systems preserves decidability, under the natural restriction that the stack content is visible. The proof follows the same lines as in the case of finite systems, but requires to use (collapsible) alternating pushdown tree automata. Such automata are undecidable, but semi-alternating pushdown tree automata were introduced and proved decidable, to study a strategic problem on pushdown systems with two players. In order to tackle multiple players with hierarchical information, we refine further these automata: we define direction-guided (collapsible) pushdown tree automata, and show that they are stable under projection, nondeterminisation and narrowing. For the latter operation, used to deal with imperfect information, stability holds under some assumption that is satisfied when used for systems with visible stack. We then use these automata to prove our main result.



There are no comments yet.


page 1

page 2

page 3

page 4


Strategy Logic with Imperfect Information

We introduce an extension of Strategy Logic for the imperfect-informatio...

Alternating Tree Automata with Qualitative Semantics

We study alternating automata with qualitative semantics over infinite b...

Higher-Order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

This paper studies the logical properties of a very general class of inf...

Reasoning about Knowledge and Strategies under Hierarchical Information

Two distinct semantics have been considered for knowledge in the context...

Dealing with imperfect information in Strategy Logic

We propose an extension of Strategy Logic (SL), in which one can both re...

Playing odds and evens with finite automata

This paper is concerned with asymptotic behaviour of a repeated game of ...

Bisimulations for Verifying Strategic Abilities with an Application to the ThreeBallot Voting Protocol

We propose a notion of alternating bisimulation for strategic abilities ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.