id: 02080227
dt: a
an: 02080227
au: Kshemkalyani, Ajay D.
ti: Concurrent knowledge and logical clock abstractions.
so: Kapoor, Sanjiv (ed.) et al., FST TCS 2000: Foundations of software
    technology and theoretical computer science. 20th conference, New
    Delhi, India, December 13‒15, 2000. Proceedings. Berlin: Springer
    (ISBN 3-540-41413-4). Lect. Notes Comput. Sci. 1974, 489-502 (2000).
py: 2000
pu: Berlin: Springer
la: EN
cc: 
ut: 
ci: 
li: http://link.springer.de/link/service/series/0558/bibs/1974/19740489.htm
ab: Summary: Vector and matrix clocks are extensively used in asynchronous
    distributed systems. This paper asks, “how does the clock abstraction
    generalize?” and casts the problem in terms of concurrent knowledge.
    To this end, the paper motivates and proposes logical clocks of
    arbitrary dimensions. It then identifies and explores the conceptual
    link between such clocks and knowledge. It establishes the necessary
    and sufficient conditions on the size and dimension of clocks required
    to declare $k$-level concurrent knowledge about the most recent global
    facts for which this is possible without using control messages. It
    then gives algorithms to compute the latest global fact about which a
    specified level of knowledge is attainable in a given state, and to
    compute the earliest state in which a specified level of knowledge
    about a given global fact is attainable.
rv: