Epistemic Modelling and Protocol Dynamics

PhD Thesis
Wang, Yanjing
PhD Thesis, University of Amsterdam, 2010
Publication year: 2010

Verifying epistemic protocols under common knowledge

Proceeding PaperTARK
Wang, Yanjing and Kuppusamy, Lakshmanan and van Eijck, Jan
In Proceedings of Conference on Theoretical Aspects of Rationality and Knowledge (TARK) 2009, 2009
Publication year: 2009

Abstract. Epistemic protocols are communication protocols aiming at transfer of knowledge in a controlled way. Typically, the preconditions or goals for protocol actions depend on the knowledge of agents, often in nested form. Informal epistemic protocol descriptions for muddy children, coordinated attack, dining cryptographers, Russian cards, secret key exchange are well known. The contribution of this paper is a formal study of a natural requirement on epistemic protocols, that the contents of the protocol can be assumed to be common knowledge. By formalizing this requirement we can prove that there can be no unbiased deterministic protocol for the Russian cards problem. For purposes of our formal analysis we introduce an epistemic protocol language, and we show that its model checking problem is decidable.

On Expressive Power and Class Invariance

Notes
Yanjing Wang, Francien Dechesne
arXiv:0905.4332
Publication year: 2009

In computer science, various logical languages are defined to analyze the properties of systems. One way to pinpoint the essential differences between those logics is to compare their expressivity in terms of distinguishing power and expressive power. In this paper, we study those two concepts by regarding the latter notion as the former lifted to classes of models. We show some general results on lifting an invariance relation on models to one on classes of models, such that when the former corresponds to the distinguishing power of a logic, the latter corresponds to its expressive power, given certain compactness requirements. In particular, we introduce the notion of class bisimulation to capture the expressive power of modal logics. We demonstrate the application of our results by revisiting modal definability with our new insights.

Refinement of Kripke Models for dynamics

Proceeding Paper
Dechesne, Francien and Orzan, Simona and Wang, Yanjing
In Proceedings of ICTAC 2008, 2008
Publication year: 2008

Abstract. 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 static models assures us to safely reason about any dynamic properties 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.

Propositional dynamic logic as a logic of belief revision

Proceeding PaperWoLLIC
Van Eijck, Jan and Wang, Yanjing
In Proceedings of WOLLIC 2008, 2008
Publication year: 2008

PDL over accelerated labeled transition systems

Proceeding Paper
Chen, Taolue and Van De Pol, Jaco and Wang, Yanjing
In Proceedings of IFIP/IEEE International Symposium on Theoretical Aspects of Software Engineering (TASE) 2008, 2008
Publication year: 2008

Abstract. We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition systems labeled with regular expressions over action labels. We study the model checking and satisfiability decision problems. Through a notion of regular expression rewriting, we reduce these two problems to the corresponding ones of PDL in the traditional semantics (w.r.t. LTS). As for the complexity, both of problems are proved to be EXPSPACE-complete. Moreover, the program, complexity of model checking problem turns out to be Nlogspace-complete. Furthermore, we provide an axiomatization for PDL which involves Kleene Algebra as an Oracle. The soundness and completeness are shown.

Risk Balance in Exchange Protocols

Proceeding Paper
Torabi Dashti, Mohammad and Wang, Yanjing
In Proceedings of ASIAN 2007, 2007
Publication year: 2007

Dynamic epistemic verification of security protocols : framework and case study

LORIProceeding Paper
Dechesne, Francien and Wang, Yanjing
In Proceedings of LORI 2007, 2007
Publication year: 2007