DocumentCode
1995788
Title
Axioms for knowledge and time in distributed systems with perfect recall
Author
Van der Meyden, Ron
Author_Institution
NTT Basic Res. Labs., Kanagawa, Japan
fYear
1994
fDate
4-7 Jul 1994
Firstpage
448
Lastpage
457
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”
Keywords
distributed processing; temporal logic; temporal reasoning; asynchronous systems; completeness; distributed systems; knowledge axioms; linear time operators; modal operators; next; perfect recall; previous states; propositional modal logic; time axioms; until; Clocks; Concurrency control; Data structures; Laboratories; Logic; Protocols; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1994. LICS '94. Proceedings., Symposium on
Conference_Location
Paris
Print_ISBN
0-8186-6310-3
Type
conf
DOI
10.1109/LICS.1994.316046
Filename
316046
Link To Document