Model checking an epistemic μ-calculus with synchronous and perfect recall semantics

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We identify a subproblem of the model-checking problem for the epistemic μ-calculus which is decidable. Formulas in the instances of this subproblem allow free variables within the scope of epistemic modalities in a restricted form that avoids embodying any form of common knowledge. Our subproblem subsumes known decidable fragments of epistemic CTL/LTL, may express winning strategies in two-player games with one player having imperfect information and non-observable objectives, and, with a suitable encoding, decidable instances of the model-checking problem for ATLiR.

Original languageEnglish
Title of host publicationProceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013
EditorsBurkhard C. Schipper
PublisherInstitute of Mathematical Sciences
Pages176-185
Number of pages10
ISBN (Electronic)9780615747163
Publication statusPublished - 1 Jan 2013
Externally publishedYes
Event14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013 - Chennai, India
Duration: 7 Jan 20139 Jan 2013

Publication series

NameProceedings of the 14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013

Conference

Conference14th Conference on Theoretical Aspects of Rationality and Knowledge, TARK 2013
Country/TerritoryIndia
CityChennai
Period7/01/139/01/13

Fingerprint

Dive into the research topics of 'Model checking an epistemic μ-calculus with synchronous and perfect recall semantics'. Together they form a unique fingerprint.

Cite this