What processes know: Definitions and proof methods

Shmuel Katz; Gadi Taubenfeld

doi:10.1145/10590.10612

What processes know: Definitions and proof methods

Shmuel Katz
, Gadi Taubenfeld

פרסום מחקרי: פרק בספר / בדוח / בכנס › פרסום בספר כנס › ביקורת עמיתים

תקציר

The importance of the notion of knowledge in reasoning about distributed systems has been recently pointed out by several works. It has been argued that a distributed computation can be understood and analyzed by considering how it affects the state of knowledge of the system. We show that there are a variety of definitions which can reasonably be applied to what a process can know about the global state. We also move beyond the semantic definitions, and present the first proof methods for proving knowledge assertions. Both shared memory and message passing models are considered.

שפה מקורית	אנגלית
כותר פרסום המארח	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing
מוציא לאור	Association for Computing Machinery
עמודים	249-262
מספר עמודים	14
מסת"ב (אלקטרוני)	0897911989
מזהי עצם דיגיטלי (DOIs)	https://doi.org/10.1145/10590.10612
סטטוס פרסום	פורסם - 1 נוב׳ 1986
פורסם באופן חיצוני	כן
אירוע	5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986 - Calgary, קנדה משך הזמן: 11 אוג׳ 1986 → 13 אוג׳ 1986

סדרות פרסומים

שם	Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

כנס

כנס	5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986
מדינה/אזור	קנדה
עיר	Calgary
תקופה	11/08/86 → 13/08/86

הערה ביבליוגרפית

Publisher Copyright:
© 1986 ACM.

גישה למסמך

10.1145/10590.10612

קבצים וקישורים אחרים

Link to publication in Scopus

פורמט ציטוט ביבליוגרפי

@inproceedings{28b6a1b561b34f06a684d9c3fbc2bb39,

title = "What processes know: Definitions and proof methods",

abstract = "The importance of the notion of knowledge in reasoning about distributed systems has been recently pointed out by several works. It has been argued that a distributed computation can be understood and analyzed by considering how it affects the state of knowledge of the system. We show that there are a variety of definitions which can reasonably be applied to what a process can know about the global state. We also move beyond the semantic definitions, and present the first proof methods for proving knowledge assertions. Both shared memory and message passing models are considered.",

author = "Shmuel Katz and Gadi Taubenfeld",

note = "Publisher Copyright: {\textcopyright} 1986 ACM.; 5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986 ; Conference date: 11-08-1986 Through 13-08-1986",

year = "1986",

month = nov,

day = "1",

doi = "10.1145/10590.10612",

language = "אנגלית",

series = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

publisher = "Association for Computing Machinery",

pages = "249--262",

booktitle = "Proceedings of the Annual ACM Symposium on Principles of Distributed Computing",

}

Katz, S & Taubenfeld, G 1986, What processes know: Definitions and proof methods. ב- Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Proceedings of the Annual ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, עמודים 249-262, 5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986, Calgary, קנדה, 11/08/86. https://doi.org/10.1145/10590.10612

What processes know: Definitions and proof methods. / Katz, Shmuel; Taubenfeld, Gadi.
Proceedings of the Annual ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 1986. עמוד 249-262 (Proceedings of the Annual ACM Symposium on Principles of Distributed Computing).

פרסום מחקרי: פרק בספר / בדוח / בכנס › פרסום בספר כנס › ביקורת עמיתים

TY - GEN

T1 - What processes know

T2 - 5th Annual ACM Symposium on Principles of Distributed Computing, PODC 1986

AU - Katz, Shmuel

AU - Taubenfeld, Gadi

PY - 1986/11/1

Y1 - 1986/11/1

N2 - The importance of the notion of knowledge in reasoning about distributed systems has been recently pointed out by several works. It has been argued that a distributed computation can be understood and analyzed by considering how it affects the state of knowledge of the system. We show that there are a variety of definitions which can reasonably be applied to what a process can know about the global state. We also move beyond the semantic definitions, and present the first proof methods for proving knowledge assertions. Both shared memory and message passing models are considered.

AB - The importance of the notion of knowledge in reasoning about distributed systems has been recently pointed out by several works. It has been argued that a distributed computation can be understood and analyzed by considering how it affects the state of knowledge of the system. We show that there are a variety of definitions which can reasonably be applied to what a process can know about the global state. We also move beyond the semantic definitions, and present the first proof methods for proving knowledge assertions. Both shared memory and message passing models are considered.

UR - https://www.scopus.com/pages/publications/0342890562

U2 - 10.1145/10590.10612

DO - 10.1145/10590.10612

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0342890562

T3 - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

SP - 249

EP - 262

BT - Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

PB - Association for Computing Machinery

Y2 - 11 August 1986 through 13 August 1986

ER -

What processes know: Definitions and proof methods

תקציר

סדרות פרסומים

כנס

הערה ביבליוגרפית

גישה למסמך

קבצים וקישורים אחרים

טביעת אצבע

פורמט ציטוט ביבליוגרפי