Paper: Axioms for knowledge and time in distributed systems with perfect recall (at LICS 1994)

Authors: Ron van der Meyden

Abstract

A distributed system, possibly asynchronous, is said to have perfect recall if at all times each processor's state includes a record of all its previous states. The completeness of a propositional modal logic of knowledge and time with respect to such systems is established. The logic includes modal operators for knowledge, and the linear time operators “next” and “until”

BibTeX

  @InProceedings{vanderMeyden-Axiomsforknowledgea,
    author = 	 {Ron van der Meyden},
    title = 	 {Axioms for knowledge and time in distributed systems with perfect recall },
    booktitle =  {Proceedings of the Ninth Annual IEEE Symposium on Logic in Computer Science (LICS 1994)},
    year =	 {1994},
    month =	 {July}, 
    pages =      {448--457},
    location =   {Paris, France}, 
    publisher =	 {IEEE Computer Society Press}
  }