Y. Moses, Knowledge in a distributed environment, Ph.D. Thesis, Stanford University Technical report STAN-CS-1120, 1986. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
An Actor Formalism For Open Concurrent Systems - Shyamasundar Anna Patterson (Correct)
....manner by a number of robots; in case the lifting actions of the participating robots do not coincide, the results will not be desirable. In a sense, we have to arrive at some common knowledge. Since without a global clock we can at best arrive at ffl common knowledge (see, for example, [Mos86]) we should provide sufficient flexibility so that the critical actions may be reliably performed in synchrony. Note that a correct implementation of this example needs further specification of constraints on the underlying system, for example, constraints on such factors as the time delays in a ....
Y. Moses. Knowledge in a distributed environment. Technical Report STAN-CS-86-1120, Stanford University, 1986.
A Little Knowledge Goes a Long Way: Knowledge-based.. - Halpern, Zuck (1992) (12 citations) (Correct)
....defined to be a function from the non negative integers to global states. Intuitively, a run is a description of the relevant features of the system over time. We occasionally refer to a pair (r; m) consisting of a run r and a time m as a point. As has been done in numerous previous papers (e.g. [HF85, HM90, Mos86, PR85]) we identify a distributed system with a set R of runs. We say (r; m) is a point in system R if r 2 R. For protocols solving the sequence transmission problem, the processes are S and R. Thus a global state s is a tuple of the form (s e ; s S ; s R ) where s e is the environment state, s S is ....
Y. Moses. Knowledge in a distributed environment. PhD thesis, Stanford University, 1986.
Programming Simultaneous Actions Using Common Knowledge - Moses, Tuttle (1988) (37 citations) Self-citation (Moses) (Correct)
....Our analysis applies to the crash failure model as well, and formally extends [DM] to the whole class of simultaneous choice problems. Our approach is based on the close relationship between knowledge, communication, and action in distributed systems: A number of recent works ( HM] DM] [Mo]) show that simultaneous actions are closely related to common knowledge. Informally, a fact is common knowledge if it is true, everyone knows it, everyone knows that everyone knows 1 it, and so on ad infinitum. Notice that every processor performing a simultaneous action knows the action is ....
.... eventually coordinated actions in such synchronous systems is quite different from that of performing simultaneous actions (see [DRS] In addition to common knowledge, an analysis of eventually coordinated actions may be able to make good use of the notion of eventual common knowledge ( HM] [Mo]) We note that it is possible to show that for eventual choice problems there do not, in general, exist protocols that are optimal in all runs. For example, one can give two protocols for (eventual) Byzantine agreement with the property that for every operating environment one of these protocols ....
Y. Moses, Knowledge in a distributed environment, Ph.D. Thesis, Stanford University Technical report STAN-CS-1120, 1986.
Programming Simultaneous Actions Using Common Knowledge.. - Moses, Tuttle (1988) (37 citations) Self-citation (Moses) (Correct)
....perform as poorly as they do in their worst case run. We will often use optimal as shorthand for optimal in all runs. Our approach is based on the close relationship between knowledge, communication and action in distributed systems. More specifically, a number of recent works (cf. HM] DM] [Mo]) point out that simultaneous actions are closely related to common knowledge. Informally, a fact is common knowledge if it is true, everyone knows it, everyone knows that everyone knows it, and so on ad infinitum. Roughly speaking, every processor performing a simultaneous action an action ....
.... that the problem of performing eventually coordinated actions is quite very different from performing simultaneous actions (cf. DRS] In addition to common knowledge, an analysis of eventually coordinated actions may be able to make good use of the notion of eventual common knowledge (cf. HM] [Mo]) We note that it is possible to show that for eventual choice problems there do not, in general, exist protocols that are optimal in all runs. For example, one can give two protocols for (eventual) Byzantine agreement with the property that for every operating environment one of these protocols ....
Y. Moses, Knowledge in a distributed environment, Ph.D. Thesis, Stanford University Technical report STAN-CS-1120, 1986.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC