The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Reasoning about knowledge
Common knowledge and update in finite environments
Information and Computation
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
Dynamic Logic
Introduction to Multiagent Systems
Introduction to Multiagent Systems
Practical Reasoning with Procedural Knowledge
FAPR '96 Proceedings of the International Conference on Formal and Applied Practical Reasoning
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
Verifying epistemic properties of multi-agent systems via bounded model checking
Fundamenta Informaticae - Concurrency specification and programming
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
Update and Abstraction in Model Checking of Knowledge and Branching Time
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Well-structured model checking of multiagent systems
PSI'06 Proceedings of the 6th international Andrei Ershov memorial conference on Perspectives of systems informatics
Hi-index | 0.00 |
We present a summary of our studies (in period 2002-2007) of the model checking problem for finitely-generated synchronous/asynchronous environments with/without perfect recall for combinations of propositional logics of (common) knowledge, (branching) time, and actions.