Corpus ID: 73729259

Model Checking ATL* on vCGS

@article{Belardinelli2019ModelCA,
  title={Model Checking ATL* on vCGS},
  author={F. Belardinelli and C. Dima and Ioana Boureanu and Vadim Malvone},
  journal={ArXiv},
  year={2019},
  volume={abs/1903.04350}
}
We prove that the model checking ATL* on concurrent game structures with propositional control for atom-visibility (vCGS) is undecidable. To do so, we reduce this problem to model checking ATL* on iCGS. 
1 Citations
Verifying Strategic Abilities in Multi-agent Systems with Private Data-Sharing
TLDR
This work devise concurrent game structures with propositional control for atom-visibility (vCGS) and puts forward a methodology to model check a formula varphi in ATL* on a vCGS M, by verifying a suitable translation ofvarphi in a submodel of M. Expand

References

SHOWING 1-3 OF 3 REFERENCES
Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable
TLDR
A formal proof of the undecidability of the model checking problem for alternatingtime temporal logic under imperfect information and perfect recall semantics is proposed, based on a direct reduction from the non-halting problem for Turing machines. Expand
Model Checking Abilities under Incomplete Information Is Indeed Delta2-complete
TLDR
It is shown that ∆2 -hardness is proved through a reduction of the SNSAT problem, while the membership in ∆ P 2 stems from the algorithm presented in [18], thus con rming the initial intuition of Schobbens. Expand
Alternating-time logic with imperfect recall
TLDR
A variant of the alternating-time temporal logic (ATL) where each agent has a given memory is studied and it is shown that it is an interesting compromise, rather realistic but with a reasonable complexity. Expand