Lynch, Nancy A. (Nancy Ann) 1948
Overview
Works:  152 works in 370 publications in 1 language and 2,519 library holdings 

Genres:  Conference papers and proceedings 
Roles:  Author, Editor, Creator, Other 
Classifications:  QA76.9.A43, 
Publication Timeline
.
Most widely held works about
Nancy A Lynch
Most widely held works by
Nancy A Lynch
Distributed algorithms by
Nancy A Lynch(
Book
)
28 editions published between 1996 and 2010 in English and Undetermined and held by 552 WorldCat member libraries worldwide
The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms  to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures
28 editions published between 1996 and 2010 in English and Undetermined and held by 552 WorldCat member libraries worldwide
The book also provides readers with the basic mathematical tools for designing new algorithms and proving new impossibility results. In addition, it teaches readers how to reason carefully about distributed algorithms  to model them formally, devise precise specifications for their required behavior, prove their correctness, and evaluate their performance with realistic measures
Hybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 2325, 2000
: proceedings by
Nancy Lynch(
Book
)
23 editions published between 2000 and 2002 in English and held by 294 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the Third International Workshop on Hybrid Systems: Computation and Control, HSCC 2000, held in Pittsburgh, PA, USA in March 2000. The 32 revised full papers presented together with abstracts of four invited talks were carefully reviewed and selected from a total of 71 papers submitted. The focus of the works presented is on modeling, control, synthesis, design and verification of hybrid systems. Among the application areas covered are control of electromechanical systems, air traffic control, control of automated freeways, and chemical process control
23 editions published between 2000 and 2002 in English and held by 294 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the Third International Workshop on Hybrid Systems: Computation and Control, HSCC 2000, held in Pittsburgh, PA, USA in March 2000. The 32 revised full papers presented together with abstracts of four invited talks were carefully reviewed and selected from a total of 71 papers submitted. The focus of the works presented is on modeling, control, synthesis, design and verification of hybrid systems. Among the application areas covered are control of electromechanical systems, air traffic control, control of automated freeways, and chemical process control
Atomic transactions by
Nancy A Lynch(
Book
)
7 editions published in 1994 in English and held by 195 WorldCat member libraries worldwide
7 editions published in 1994 in English and held by 195 WorldCat member libraries worldwide
Distributed computing : 24th international symposium, DISC 2010, Cambridge, MA, USA, September 1315, 2010 ; proceedings by
Nancy A Lynch(
)
11 editions published in 2010 in English and held by 40 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 24th International Symposium on Distributed Computing, DISC 2010, held in Cambridge, CT, USA, in September 2010. The 32 revised full papers, selected from 135 submissions, are presented together with 14 brief announcements of ongoing works; all of them were carefully reviewed and selected for inclusion in the book. The papers address all aspects of distributed computing, and were organized in topical sections on, transactions, shared memory services and concurrency, wireless networks, best student paper, consensus and leader election, mobile agents, computing in wireless and mobile networks, modeling issues and adversity, and selfstabilizing and graph algorithms
11 editions published in 2010 in English and held by 40 WorldCat member libraries worldwide
This book constitutes the refereed proceedings of the 24th International Symposium on Distributed Computing, DISC 2010, held in Cambridge, CT, USA, in September 2010. The 32 revised full papers, selected from 135 submissions, are presented together with 14 brief announcements of ongoing works; all of them were carefully reviewed and selected for inclusion in the book. The papers address all aspects of distributed computing, and were organized in topical sections on, transactions, shared memory services and concurrency, wireless networks, best student paper, consensus and leader election, mobile agents, computing in wireless and mobile networks, modeling issues and adversity, and selfstabilizing and graph algorithms
The theory of timed I/O automata by
Dilsun K Kaynar(
Book
)
4 editions published between 2006 and 2010 in English and held by 35 WorldCat member libraries worldwide
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, realtime operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability req
4 editions published between 2006 and 2010 in English and held by 35 WorldCat member libraries worldwide
This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range of domains including communications, embedded systems, realtime operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability req
Using mappings to prove timing properties by
Nancy A Lynch(
Book
)
15 editions published between 1989 and 1992 in English and held by 25 WorldCat member libraries worldwide
A new technique for proving timing properties for timingbased algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automation whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multivalued mapping from the assumptions automation to the requirements automation is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of progress functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a twoprocess race system
15 editions published between 1989 and 1992 in English and held by 25 WorldCat member libraries worldwide
A new technique for proving timing properties for timingbased algorithms is described; it is an extension of the mapping techniques previously used in proofs of safety properties for asynchronous concurrent systems. The key to the method is a way of representing a system with timing constraints as an automation whose state includes predictive timing information. Timing assumptions and timing requirements for the system are both represented in this way. A multivalued mapping from the assumptions automation to the requirements automation is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of progress functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a twoprocess race system
Hybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 22325, 2000
: proceedings by HSCC 2000(
Book
)
3 editions published in 2000 in English and held by 23 WorldCat member libraries worldwide
3 editions published in 2000 in English and held by 23 WorldCat member libraries worldwide
Relativization of the theory of computational complexity by
Nancy A Lynch(
Book
)
10 editions published in 1972 in English and Undetermined and held by 17 WorldCat member libraries worldwide
Blum's machineindependent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). The author proves relativeizations of several results of Blum complexity theory. A recursive relatedness theorem is proved, showing that any two relative complexity measures are related by a fixed recursive function. This theorem allows one to obtain proofs of results for all measures from proofs for a particular measure. The author studies complexitydetermined reducibilities, the parallel notion to complexity classes for the relativized case. Truthtable and primitive recursive reducibilities are reducibilities of this type. The concept of a set helping the computation of a function is formalized. Basic properties of the helping relation are proved, including nontransitivity and bounds on the amount of help certain sets can provide. (Author)
10 editions published in 1972 in English and Undetermined and held by 17 WorldCat member libraries worldwide
Blum's machineindependent treatment of the complexity of partial recursive functions is extended to relative algorithms (as represented by Turing machines with oracles). The author proves relativeizations of several results of Blum complexity theory. A recursive relatedness theorem is proved, showing that any two relative complexity measures are related by a fixed recursive function. This theorem allows one to obtain proofs of results for all measures from proofs for a particular measure. The author studies complexitydetermined reducibilities, the parallel notion to complexity classes for the relativized case. Truthtable and primitive recursive reducibilities are reducibilities of this type. The concept of a set helping the computation of a function is formalized. Basic properties of the helping relation are proved, including nontransitivity and bounds on the amount of help certain sets can provide. (Author)
Time bounds for realtime process control in the presence of timing uncertainty by
Hagit Attiya(
Book
)
6 editions published between 1989 and 1991 in English and held by 13 WorldCat member libraries worldwide
Abstract: "A timingbased variant of the mutual exclusion problem is considered. In this variant, only an upperbound, 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 realtime systems."
6 editions published between 1989 and 1991 in English and held by 13 WorldCat member libraries worldwide
Abstract: "A timingbased variant of the mutual exclusion problem is considered. In this variant, only an upperbound, 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 realtime systems."
Forward and backward simulations by
Nancy A Lynch(
Book
)
12 editions published between 1993 and 1994 in English and Undetermined and held by 13 WorldCat member libraries worldwide
12 editions published between 1993 and 1994 in English and Undetermined and held by 13 WorldCat member libraries worldwide
Hybrid I/O automata by
Nancy A Lynch(
Book
)
7 editions published between 1995 and 2002 in English and Undetermined and held by 11 WorldCat member 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."
7 editions published between 1995 and 2002 in English and Undetermined and held by 11 WorldCat member 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."
Concurrency control for resilient nested transactions by
Nancy A Lynch(
Book
)
5 editions published between 1983 and 1986 in English and held by 11 WorldCat member libraries worldwide
A formal framework is developed for providing correctness of algorithms which implement nested transactions. In particular, a simple action tree data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transactions have of the data. A generalization of serializability to the domain of nested transactions with failures is defined. A characterization is given for this generalization of serializability, in terms of absence of cycles in an appropriate dependency relation on transactions. A slightly simplified version of Moss' locking algorithm is presented in detail, and a careful correctness proof is given. The style of correctness proof appears to be quite interesting in its own right. The description of the algorithm, from its initial specification to its detailed implementation, is presented as a series of eventstate algebra levels, each of which simulates the previous one in a straightforward way. (Author)
5 editions published between 1983 and 1986 in English and held by 11 WorldCat member libraries worldwide
A formal framework is developed for providing correctness of algorithms which implement nested transactions. In particular, a simple action tree data structure is defined, which describes the ancestor relationships among executing transactions and also describes the views which different transactions have of the data. A generalization of serializability to the domain of nested transactions with failures is defined. A characterization is given for this generalization of serializability, in terms of absence of cycles in an appropriate dependency relation on transactions. A slightly simplified version of Moss' locking algorithm is presented in detail, and a careful correctness proof is given. The style of correctness proof appears to be quite interesting in its own right. The description of the algorithm, from its initial specification to its detailed implementation, is presented as a series of eventstate algebra levels, each of which simulates the previous one in a straightforward way. (Author)
A serialization graph construction for nested transactions by
Alan Fekete(
Book
)
4 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
This paper makes three contributions. First, we present a proof technique that offers system designers the same ease of reasoning about nested transaction systems as is given by the classical theory for systems without nesting, and yet can be used to verify that a system satisfies the robust user view definition of correctness of another work. Second, as applications of the technique, we verify the correctness of Moss' read/write locking algorithm for nested transactions, and of an undo logging algorithm that has not previously been presented or proved for nested transaction systems. Third, we make explicit the assumptions used for this proof technique, assumptions that are usually made implicitly in the classical theory, and therefore we clarify the type of system for which the classical theory itself can reliably be used. Keywords: Concurrency control; Recovery; Faulttolerance; Nested transactions; Serializability; Verification. (kr)
4 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
This paper makes three contributions. First, we present a proof technique that offers system designers the same ease of reasoning about nested transaction systems as is given by the classical theory for systems without nesting, and yet can be used to verify that a system satisfies the robust user view definition of correctness of another work. Second, as applications of the technique, we verify the correctness of Moss' read/write locking algorithm for nested transactions, and of an undo logging algorithm that has not previously been presented or proved for nested transaction systems. Third, we make explicit the assumptions used for this proof technique, assumptions that are usually made implicitly in the classical theory, and therefore we clarify the type of system for which the classical theory itself can reliably be used. Keywords: Concurrency control; Recovery; Faulttolerance; Nested transactions; Serializability; Verification. (kr)
The need for headers : an impossibility result for communication over unreliable channels by
Alan Fekete(
Book
)
4 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
It is proved that any protocol that constructs a reliable data link service using a physical channel service necessarily includes in the packets some header information that enables the protocol to treat different packets differently. The physical channel considered is permitted to lose, but not reorder or duplicate packets. The formal framework used for the proof is the input/output automation moded. Keywords: Concurrent programming
4 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
It is proved that any protocol that constructs a reliable data link service using a physical channel service necessarily includes in the packets some header information that enables the protocol to treat different packets differently. The physical channel considered is permitted to lose, but not reorder or duplicate packets. The formal framework used for the proof is the input/output automation moded. Keywords: Concurrent programming
Distributed computing 24th international symposium, DISC 2010, Cambridge, MA, USA, September 13  15, 2010 ; proceedings(
)
1 edition published in 2010 in English and held by 9 WorldCat member libraries worldwide
1 edition published in 2010 in English and held by 9 WorldCat member libraries worldwide
Impossibility of distributed consensus with one faulty process by
Michael J Fischer(
Book
)
4 editions published in 1982 in English and held by 9 WorldCat member libraries worldwide
4 editions published in 1982 in English and held by 9 WorldCat member libraries worldwide
Hierarchical correctness proofs for distributed algorithms by M. R Tuttle(
Book
)
3 editions published in 1987 in English and Undetermined and held by 9 WorldCat member libraries worldwide
This thesis introduces a new model for distributed computation in asynchronous networks, the inputoutput automaton. This simple, powerful model captures in a novel way the gametheoretical interaction between a system and its environment, and allows fundamental properties of distributed computation such as fair computation to be naturally expressed. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the inputoutput automaton model, and presents an interesting example of how this model can be used to construct such proofs
3 editions published in 1987 in English and Undetermined and held by 9 WorldCat member libraries worldwide
This thesis introduces a new model for distributed computation in asynchronous networks, the inputoutput automaton. This simple, powerful model captures in a novel way the gametheoretical interaction between a system and its environment, and allows fundamental properties of distributed computation such as fair computation to be naturally expressed. Furthermore, this model can be used to construct modular, hierarchical correctness proofs of distributed algorithms. This thesis defines the inputoutput automaton model, and presents an interesting example of how this model can be used to construct such proofs
Distributed algorithms : Lecture notes for 6.852, fall semester 1988 by
Nancy A Lynch(
Book
)
9 editions published between 1989 and 1993 in English and held by 9 WorldCat member libraries worldwide
9 editions published between 1989 and 1993 in English and held by 9 WorldCat member libraries worldwide
Probabilistic analysis of a network resource allocation algorithm by
Nancy A Lynch(
Book
)
6 editions published between 1983 and 1985 in English and held by 8 WorldCat member libraries worldwide
A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made nondeterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one that are sent during the execution of the algorithm, and that this number of message is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way. (Author)
6 editions published between 1983 and 1985 in English and held by 8 WorldCat member libraries worldwide
A distributed algorithm is presented, for allocating a large number of identical resources (such as airline tickets) to requests which can arrive anywhere in a distributed network. Resources, once allocated, are never returned. The algorithm searches sequentially, exhausting certain neighborhoods of the request origin before proceeding to search at greater distances. Choice of search direction is made nondeterministically. Analysis of expected response time is simplified by assuming that the search direction is chosen probabilistically, that messages require constant time, that the network is a tree with all leaves at the same distance from the root, and that requests and resources occur only at leaves. It is shown that the response time is approximated by the number of messages of one that are sent during the execution of the algorithm, and that this number of message is a nondecreasing function of the interarrival time for requests. Therefore, the worst case occurs when requests come in so far apart that they are processed sequentially. The expected time for the sequential case of the algorithm is analyzed by standard techniques. This time is shown to be bounded by a constant, independent of the size of the network. It follows that the expected response time for the algorithm is bounded in the same way. (Author)
The Byzantine firing squad problem by
James E Burns(
Book
)
2 editions published in 1985 in English and held by 8 WorldCat member libraries worldwide
2 editions published in 1985 in English and held by 8 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
 Shvartsman, Alex Allister
 Krogh, Bruce H. Other Editor
 Massachusetts Institute of Technology Laboratory for Computer Science
 Fekete, Alan Author
 Attiya, Hagit Author
 Vaandrager, Frits W. Author
 MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE
 Segala, Roberto 1968
 Kaynar, Dilsun K. Author
 DISC 2010 Cambridge, Mass
Useful Links
Associated Subjects
Algorithms Artificial intelligence Carson, W. H Columbia (S.C.) Computational complexity Computer algorithms Computer inputoutput equipment Computer network protocols Computer networks Computer programsVerification Computer science Computer simulation Computer software Database management Data transmission systems Digital control systems Distributed databases Electronic data processingDistributed processing Electronic data processingDistributed processingMathematical models Engineering Faulttolerant computing Hybrid computers Interior architecture Logic design Machine theory Mappings (Mathematics) Miller, G. P Miller, J. L Network analysis (Planning) Packet switching (Data transmission) Parallel processing (Electronic computers) Physics Probabilities Railroad stations Realtime control Realtime data processing Reasoning Recursive functions Software engineering Southern Railway (U.S.) Structural control (Engineering) Temporal automata Transaction systems (Computer systems) Trees (Graph theory) Turing machines
Alternative Names
Lynch, N. 1948
Lynch, N. A. 1948
Lynch, Nancy.
Lynch, Nancy 1948
Lynch, Nancy A.
Lynch, Nancy Ann 1948
Nancy Lynch Amerikaans informatica
Nancy Lynch amerikansk informatikar
Nancy Lynch amerikansk informatiker
Nancy Lynch chercheuse américaine
Nancy Lynch científica y profesora estadounidense
Nancy Lynch informatica statunitense
Nancy Lynch USamerikanische Informatikerin
Nancy Lynchová
نانسی لینچ دانشمند علوم کامپیوتر آمریکایی
ナンシー・リンチ
南希·林奇
Languages
Covers