◍wovepaper
SearchResearchersInstitutions
Sign in
cs.LOMar 11, 2019
authors
  • Francesco Belardinelli
  • Catalin Dima
  • Ioana Boureanu
  • Vadim Malvone
arXiv abstractPDF
paper

Model Checking ATL* on vCGS

arXiv:1903.04350

Abstract

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.

References in corpus (1)

  • Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable
◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.