Logics of time and computation
Logics of time and computation
Relations and graphs: discrete mathematics for computer scientists
Relations and graphs: discrete mathematics for computer scientists
Reasoning about knowledge
Relational formalisation of nonclassical logics
Relational methods in computer science
Logic in computer science: modelling and reasoning about systems
Logic in computer science: modelling and reasoning about systems
Modal logic
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
A Representation Theorem for Models of *-Free PDL
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Implementation of Relational Algebra Using Binary Decision Diagrams
ReIMICS '01 Revised Papers from the 6th International Conference and 1st Workshop of COST Action 274 TARSKI on Relational Methods in Computer Science
Model-Checking: A Tutorial Introduction
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
Comparing BDD and SAT Based Techniques for Model Checking Chaum's Dining Cryptographers Protocol
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
RelView: an OBDD-based computer algebra system for relations
CASC'05 Proceedings of the 8th international conference on Computer Algebra in Scientific Computing
MCMAS: a model checker for multi-agent systems
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
In computer science, scenarios with interacting agents are often developed using modal logic. We show how to interpret modal logic of knowledge in relation algebra. This allows the use of the RelView tool for the purpose of investigating finite models and for visualizing certain properties. Our approach is illustrated with the well-known ‘muddy children' puzzle using modal logic of knowledge. We also sketch how to treat other non-classical logics in this way. In particular, we explore our approach for computational tree logic and illustrate it with the ‘mutual exclusion' example.