Lynch, Nancy A. (Nancy Ann) 1948-

Overview

Works:	160 works in 227 publications in 2 languages and 1,738 library holdings
Roles:	Editor, Creator
Classifications:	qa76.9.a43, 005.276

Publication Timeline

1970 |

|2020

Key

Publications about Nancy A Lynch

Publications by Nancy A Lynch

Most widely held works about Nancy A Lynch

Columbia, S.C.: Southern Railway office and station] 1901-1909 ( Visual )

Most widely held works by Nancy A Lynch

Distributed algorithms by Nancy A Lynch ( Book )
21 editions published between 1989 and 2008 in English and Undetermined and held by 492 libraries worldwide
In Distributed Algorithms, Nancy Lynch provides a blueprint for designing, implementing, and analyzing distributed algorithms. She directs her book at a wide audience, including students, programmers, system designers and researchers.

Distributed computing 24th international symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010 : proceedings by DISC 2010 ( Book )
4 editions published in 2010 in English and held by 254 libraries worldwide

Hybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000 : proceedings by HSCC (Conference) ( Book )
2 editions published in 2000 in English and held by 202 libraries worldwide

Atomic transactions ( Book )
3 editions published in 1994 in English and held by 186 libraries worldwide

The theory of timed I/O automata ( Book )
3 editions published in 2006 in English and held by 34 libraries worldwide

Hybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 223-25, 2000 : proceedings by HSCC (Conference) ( Book )
1 edition published in 2000 in English and held by 23 libraries worldwide

Hybrid systems: computation and control : third international workshop ; proceedings ( Book )
2 editions published between 2000 and 2002 in English and held by 18 libraries worldwide

Relativization of the theory of computational complexity by Nancy A Lynch ( Book )
3 editions published in 1972 in English and held by 13 libraries worldwide

Hybrid systems: computation and control : third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March, 23 - 25, 2000; proceedings ( Book )
2 editions published in 2000 in English and held by 11 libraries worldwide

Hierarchical correctness proofs for distributed algorithms by Mark R Tuttle ( Book )
1 edition published in 1987 in English and held by 10 libraries worldwide

Impossibility of distributed consensus with one faulty process by Michael J Fischer ( Book )
1 edition published in 1982 in English and held by 10 libraries worldwide

Action transducers and timed automata by Nancy A Lynch ( Book )
3 editions published in 1994 in English and held by 9 libraries worldwide
Abstract: "The timed automaton model of [29,30] is a general model for timing-based systems. A notion of timed action transducer is here defined as an automata-theoretic way of representing operations on timed automata. It is shown that two timed trace inclusion relations are substitutive with respect to operations that can be described by timed action transducers. Examples are given of operations that can be described in this way, and a preliminary proposal is given for an appropriate language of operators for describing timing-based systems."

Hybrid I/O automata ( Book )
2 editions published in 1995 in English and held by 9 libraries worldwide
Abstract: "We propose a new hybrid I/O automaton model that is capable of describing both continuous and dicrete behavior. The model, which extends the timed I/O automaton model of [12, 7] and the phase transition system models of [15, 2], allows communication among components using both shared variables and shared actions. The main contributions of this paper are: (1) the definition of hybrid I/O automata and of an implementation relation based on hybrid traces, (2) the definition of a simulation between hybrid I/O automata and a proof that existence of a simulation implies the implementation relation, (3) a definition of composition of hybrid I/O automata and a proof that it respects the implementation relation, and (4) a definition of receptiveness for hybrid I/O automata and a proof that, assuming certain compatibility conditions, receptiveness is preserved by composition."

Distributed computing 24th international symposium ; proceedings ( Book )
1 edition published in 2010 in English and held by 9 libraries worldwide

The Byzantine firing squad problem by James E Burns ( Book )
1 edition published in 1985 in English and held by 9 libraries worldwide

Concurrency control for resilient nested transactions by Nancy A Lynch ( Book )
1 edition published in 1983 in English and held by 9 libraries worldwide

Multilevel atomicity : a new correctness criterion for database concurrency control by Nancy A Lynch ( Book )
1 edition published in 1982 in English and held by 9 libraries worldwide

Easy impossibility proofs for distributed consensus problems by Michael J Fischer ( Book )
2 editions published in 1985 in English and held by 8 libraries worldwide

Using mappings to prove timing properties by Nancy A Lynch ( Book )
6 editions published between 1989 and 1992 in English and held by 8 libraries worldwide

Time bounds for real-time process control in the presence of timing uncertainty by Hagit Attiya ( Book )
4 editions published between 1989 and 1991 in English and held by 8 libraries worldwide
Abstract: "A timing-based variant of the mutual exclusion problem is considered. In this variant, only an upper-bound, m, on the time it takes to release the resource is known, and no explicit signal is sent when the resource is released; furthermore, the only mechanism to measure real time is an inaccurate clock, whose tick intervals take time between two constants, c₁ [<or =] c₂. When control is centralized it is proved that [formula] is an exact bound on the worst case response time for any such algorithm, where n is the number of contenders for the resource and l is an upper bound on process step time. On the other hand, when control is distributed among processes connected via communication lines with an upper bound, d, for message delivery time, it is proved that [formula] is an upper bound. A new technique involving shifting and shrinking executions is combined with a careful analysis of the best allocation policy to prove a corresponding lower bound of [formula]. These combinatorial results shed some light on modeling and verification issues related to real-time systems."