Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics

Details Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics

2012-04-10

arxiv.org/abs/1204.2087v3

Computer Science

Logic in Computer Science

Scientific paper

We show that the model-checking problem is decidable for a fragment of the epistemic \mu-calculus. The fragment allows free variables within the scope of epistemic modalities in a restricted form that avoids constructing formulas embodying any form of common knowledge. Our calculus subsumes known decidable fragments of epistemic CTL/LTL. Its modal variant can 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 ATL with imperfect information and perfect recall can be encoded as instances of the model-checking problem for this epistemic \mu-calculus.

Affiliated with

Also associated with

No associations

Rating

Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model-checking an Epistemic μ-calculus with Synchronous and Perfect Recall Semantics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-644767