Tempo: A Toolkit for The Timed Input/Output Automata Formalism (2009)
N. Lynch, L. Michel, A. A. Shvartsman
Tempo is a simple formal language for modeling distributed, concurrent, and timed systems as collections of interacting state machines, called timed input/output automata. Tempo provides natural...
Abstract. An indulgent algorithm is a distributed algorithm that, besides tolerating process failures, also tolerates arbitrarily long periods of instability, with an unbounded number of timing and...
Hybrid I/O Automata (extended abstract) (2007)
N. Lynch, R. Segala, F. Va, Issn -x, Mathematisch Centrum (smc, The Dutch Foundation, ...
and their applications. SMC is sponsored by the Netherlands Organization for Scientific Research (NWO). CWI is a member of
for a Network Synchronizer (2007)
L. Shira, A. Fekete, A. Fekete, N. Lynch, N. Lynch, L. Shrira
Code] governs the making of photocopies or other reproductions of copyrighted material Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or...
Distrib. Comput. (2001) 14: 127–146 The BG distributed simulation algorithm ⋆ (2001)
E. Borowsky, E. Gafni, N. Lynch, S. Rajsbaum
Summary. We present a shared memory algorithm that allows a set of f +1processes to wait-free “simulate ” a larger system of n processes,that may also exhibit up to f stopping failures. Applying...
N. Lynch, R. Segala, F. W. Va, Nancy Lynch, Roberto Segala, Frits Vaandrager
Hybrid systems are systems that exhibit a combination of discrete and continuous behavior. Typical hybrid systems include computer components, which operate in discrete program steps, and real-world...
Efficient Program Transformations for Resilient Parallel Computation via Randomization (1992)
Z. M. Kedem, K. V. Palem, M. O. Rabin, A. Raghunathan, Flp M. Fischer, N. Lynch, ...
In this paper, we address the problem of automatically transforming arbitrary programs written for an ideal parallel machine to run on a completely asynchronous machine. We presentatransformation...