2,084 research outputs found
Survey of Distributed Decision
We survey the recent distributed computing literature on checking whether a
given distributed system configuration satisfies a given boolean predicate,
i.e., whether the configuration is legal or illegal w.r.t. that predicate. We
consider classical distributed computing environments, including mostly
synchronous fault-free network computing (LOCAL and CONGEST models), but also
asynchronous crash-prone shared-memory computing (WAIT-FREE model), and mobile
computing (FSYNC model)
On simulation in automata networks
An automata network is a finite graph where each node holds a state from some
finite alphabet and is equipped with an update function that changes its state
according to the configuration of neighboring states. More concisely, it is
given by a finite map . In this paper we study how some
(sets of) automata networks can be simulated by some other (set of) automata
networks with prescribed update mode or interaction graph. Our contributions
are the following. For non-Boolean alphabets and for any network size, there
are intrinsically non-sequential transformations (i.e. that can not be obtained
as composition of sequential updates of some network). Moreover there is no
universal automaton network that can produce all non-bijective functions via
compositions of asynchronous updates. On the other hand, we show that there are
universal automata networks for sequential updates if one is allowed to use a
larger alphabet and then use either projection onto or restriction to the
original alphabet. We also characterize the set of functions that are generated
by non-bijective sequential updates. Following Tchuente, we characterize the
interaction graphs whose semigroup of transformations is the full semigroup
of transformations on , and we show that they are the same if we force
either sequential updates only, or all asynchronous updates
Submicron Systems Architecture Project: Semiannual Technial Report
No abstract available
Some recent asynchronous system design methodologies
Journal ArticleWe present an in-depth study of some techniques for asynchronous system design, analysis, and verification. After defining basic terminology, we take one simple example - a four-phase t o two-phase converter - and present its design using (a) classical flow-tables; (b) Signal Transition Graphs of [8]; and (c) Trace Theory of [15]. We then present necessary and sufficient conditions for Delay Insensitivity, proposed by [38], and illustrate it on our example. Finally, we present the work of [13] on the verification of asynchronous circuits, and illustrate it on the circuits derived in the paper. The following points are emphasized: (i) presentation of techniques at more depth than in a general survey; (ii) illustration of all t h e aspects discussed on a common example; (hi) comparative study of the works presented. Many interesting works had to be left out, solely because of our lack of space and time
- …