%0 Conference Proceedings
%F genest:hal-01245016
%A Genest, B.
%A Peled, D.
%A Schewe, S.
%T Knowledge = Observation + Memory + Computation
%B FoSSaCS 2015
%V LNCS
%N 9034
%P 215-229
%S FoSSaCS 2015
%I Springer
%C London, United Kingdom
%X We compare three notions of knowledge in concurrent system: mem-oryless knowledge, knowledge of perfect recall, and causal knowledge. Mem-oryless knowledge is based only on the current state of a process, knowledge of perfect recall can take into account the local history of a process, and causal knowledge depends on the causal past of a process, which comprises the information a process can obtain when all processes exchange the information they have when performing joint transitions. We compare these notions in terms of knowledge strength, number of bits required to store this information, and the complexity of checking if a given process has a given knowledge. We show that all three notions of knowledge can be implemented using finite memory. Causal knowledge proves to be strictly more powerful than knowledge with perfect recall , which in turn proves to be strictly more powerful than memoryless knowledge. We show that keeping track of causal knowledge is cheaper than keeping track of knowledge of perfect recall
%U https://hal.archives-ouvertes.fr/hal-01245016/document
%U http://dx.doi.org/10.1007/978-3-662-46678-0\_14
%D 2015