Update and Abstraction in Model Checking of Knowledge and Branching Time

@article{Shilov2006UpdateAA,
  title={Update and Abstraction in Model Checking of Knowledge and Branching Time},
  author={Nikolay V. Shilov and Natalya Olegovna Garanina and K.-M. Choe},
  journal={Fundam. Inform.},
  year={2006},
  volume={72},
  pages={347-361}
}
We present (update+abstraction) algorithm for model checking a fusion of Computation Tree Logic and Propositional Logic of Knowledge in systems with the perfect recall synchronous semantics. It has been already known that the problem is decidable with a non-elementary lower bound. The decidability follows from interpretation of the problem in a so-called Chain Logic and then in the Second Order Logic of Monadic Successors. This time we give a direct algorithm for model checking and detailed… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

Epistemic Logic. A Survey of the Logic of Knowledge

  • N. Rescher
  • 2005
1 Excerpt

Model Checking for Alternating-Time mu-Calculus via Translation to SAT

  • M. Kacprzak, W. Penczek
  • Proc. of Concurrency, Specification and…
  • 2004
1 Excerpt

Similar Papers

Loading similar papers…