Update and Abstraction in Model Checking of Knowledge and Branching Time

Authors:
N.V. Shilov;N.O. Garanina;K.-M. Choe
Affiliations:
Institute of Informatics Systems, Russian Academy of Science 6, Lavrentiev ave., 630090, Novosibirsk, Russia. E-mails: shilov@iis.nsk.su/ garanina@iis.nsk.su;Institute of Informatics Systems, Russian Academy of Science 6, Lavrentiev ave., 630090, Novosibirsk, Russia. E-mails: shilov@iis.nsk.su/ garanina@iis.nsk.su;Korea Advanced Institute of Science and Technology 373-1 Kusong-dong Yusong-gu Taejon 305-701, Korea. E-mail: choe@cs.kaist.ac.kr
Venue:
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Year:
2006

Citing 14
Cited 1

Logics of programs

Handbook of theoretical computer science (vol. B)
Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Infinite trees and automaton-definable relations over &ohgr;-words

Theoretical Computer Science - Selected papers of the 7th Annual Symposium on theoretical aspects of computer science (STACS '90) Rouen, France, February 1990
Symbolic model checking: 1020 states and beyond

Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Reasoning about knowledge

Reasoning about knowledge
Common knowledge and update in finite environments

Information and Computation
Model checking

Model checking
Algorithmic analysis of programs with well quasi-ordered domains

Information and Computation - Special issue: LICS 1996—Part 1
Well-structured transition systems everywhere!

Theoretical Computer Science
Model Checking Knowledge and Time

Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Model Checking Knowledge and Time in Systems with Perfect Recall (Extended Abstract)

Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Complete Axiomatizations for Reasoning about Knowledge and Time

SIAM Journal on Computing
Using Temporal Logics of Knowledge in the Formal Verification of Security Protocols

TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Model Checking µ-Calculus in Well-Structured Transition Systems

TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning

Exponential improvement of time complexity of model checking for multiagent systems with perfect recall

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 time upper bound where a number of different parameters are taken into count (i.e. a number of agents, a number of states, knowledge depth, formula size). We present a toy experiment with this algorithm that encourages our hope that the algorithm can be used in practice.