Model Checking ATL* on vCGS

03/11/2019

∙

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.

READ FULL TEXT

Model Checking ATL* on vCGS

Automatic Verification of LLVM Code

Critical trees: counterexamples in model checking of CSM systems using CBS algorithm

Model Checking Algorithms for Hyperproperties

The Bouquet Algorithm for Model Checking Unbounded Until

Lifted Model Checking for Relational MDPs

Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561

User-Driven Abstraction for Model Checking

Model Checking ATL* on vCGS

Related Research

Automatic Verification of LLVM Code

Critical trees: counterexamples in model checking of CSM systems using CBS algorithm

Model Checking Algorithms for Hyperproperties

The Bouquet Algorithm for Model Checking Unbounded Until

Lifted Model Checking for Relational MDPs

Model-checking in the Foundations of Algorithmic Law and the Case of Regulation 561

User-Driven Abstraction for Model Checking