Reasoning about knowledge
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems
Automatic Abstraction Using Generalized Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Symbolic Model Checking the Knowledge of the Dining Cryptographers
CSFW '04 Proceedings of the 17th IEEE workshop on Computer Security Foundations
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Epistemic Verification of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Logics of communication and change
Information and Computation
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
Dynamic Epistemic Logic
Operational and epistemic approaches to protocol analysis: bridging the gap
LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
A Data Symmetry Reduction Technique for Temporal-epistemic Logic
ATVA '09 Proceedings of the 7th International Symposium on Automated Technology for Verification and Analysis
Abstraction for epistemic model checking of dining cryptographers-based protocols
Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge
Automatic data-abstraction in model checking multi-agent systems
MoChArt'10 Proceedings of the 6th international conference on Model checking and artificial intelligence
Abstraction for model checking modular interpreted systems over ATL
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Abstraction for model checking modular interpreted systems over ATL
ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
| Hi-index | 0.00 |
We propose a property-preserving refinement/abstraction theory for Kripke Modal Labelled Transition Systems incorporating not only state mapping but also label and proposition lumping, in order to have a compact but informative abstraction. We develop a 3-valued version of Public Announcement Logic (PAL) which has a dynamic operator that changes the model in the spirit of public broadcasting. We prove that the refinement relation on staticmodels assures us to safely reason about any dynamicproperties in terms of PAL-formulas on the abstraction of a model. The theory is in particular interesting and applicable for an epistemic setting as the example of the Muddy Children puzzle shows, especially in the view of the growing interest for epistemic modelling and (automatic) verification of communication protocols.