This paper is intended to introduce researchers to the input output automaton model and examines several illustrative examples concerning candy vending machines and other uses of the model.Expand

This thesis introduces a new model for distributed computation in asynchronous networks, the input-output automaton. This simple, powerful model captures in a novel way the game-theoretical… Expand

A new semantics for the logic of belief, with special constructs for expressing some of the central concepts used in authentication protocols, to improve the logic's syntax and inference rules, and extend its applicability.Expand

The cover time is studied and it is shown that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks.Expand

The cover time is studied and it is shown that for a large collection of interesting graphs, running many random walks in parallel yields a speed-up in the cover time that is linear in the number of parallel walks.Expand

It is shown how different assignments of probability spaces (corresponding to different opponents) yield different levels of guarantees in probabilistic coordinated attack.Expand

The proof of this result is interesting because it is the first to apply topological techniques to the synchronous model and proves tight bounds on the time needed to solve k-set agreement.Expand

A way to add a notion of time to the input-output automaton model in a way that preserves these properties is described, and the result is a simple, compositional model for real-time computation that provides a convenient notation for expressing timing properties such as bounded fairness.Expand

We take a significant step toward unifying the synchronous, semi-synchronous, and asynchronous message-passing models of distributed computation. The key idea is the concept of a pseudosphere, a new… Expand

This work defines a large class of problems requiring coordinated, simultaneous action in synchronous systems, and gives a method of transforming specifications of such problems into protocols that are optimal in all runs: these protocols are guaranteed to perform the simultaneous actions as soon as any other protocol could possibly perform them.Expand