Lynch, Nancy A. (Nancy Ann) 1948
Overview
Works:  84 works in 170 publications in 1 language and 2,181 library holdings 

Genres:  Conference proceedings 
Roles:  Author, Editor, Creator 
Classifications:  QA76.9.D5, 004.36 
Publication Timeline
.
Most widely held works by
Nancy A Lynch
Distributed algorithms
by
Nancy A Lynch(
)
24 editions published between 1996 and 2010 in English and Undetermined and held by 948 WorldCat member 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 Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automatatheoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed pr
24 editions published between 1996 and 2010 in English and Undetermined and held by 948 WorldCat member 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 Algorithms contains the most significant algorithms and impossibility results in the area, all in a simple automatatheoretic setting. The algorithms are proved correct, and their complexity is analyzed according to precisely defined complexity measures. The problems covered include resource allocation, communication, consensus among distributed pr
Distributed computing 24th international symposium, DISC 2010, Cambridge, MA, USA, September 1315, 2010 : proceedings
by
Nancy A Lynch(
)
5 editions published in 2010 in English and held by 363 WorldCat member libraries worldwide
Annotation
5 editions published in 2010 in English and held by 363 WorldCat member libraries worldwide
Annotation
Hybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 2325, 2000 : proceedings
by
Nancy A Lynch(
Book
)
13 editions published in 2000 in English and held by 290 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
13 editions published in 2000 in English and held by 290 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 196 WorldCat member libraries worldwide
7 editions published in 1994 in English and held by 196 WorldCat member libraries worldwide
The theory of timed I/O automata
by
Dilsun K Kaynar(
Book
)
5 editions published between 2006 and 2010 in English and held by 38 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
5 editions published between 2006 and 2010 in English and held by 38 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
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 24 WorldCat member libraries worldwide
3 editions published in 2000 in English and held by 24 WorldCat member libraries worldwide
The Theory of Timed I/O Automata, Second Edition
by Dilsun Kaynar(
)
1 edition published in 2010 in English and held by 20 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
1 edition published in 2010 in English and held by 20 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
)
6 editions published between 1989 and 1992 in English and held by 18 WorldCat member libraries worldwide
A new technique for proving timing properties for timing based 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 automaton 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 automaton to the requirements automaton is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of variant functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a twoprocess race system
6 editions published between 1989 and 1992 in English and held by 18 WorldCat member libraries worldwide
A new technique for proving timing properties for timing based 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 automaton 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 automaton to the requirements automaton is then used to show that the given system satisfies the requirements. One type of mapping is based on a collection of variant functions providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a twoprocess race system
Relativization of the theory of computational complexity
by
Nancy A Lynch(
Book
)
5 editions published in 1972 in English and held by 14 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)
5 editions published in 1972 in English and held by 14 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)
Hybrid I/O automata
by
Nancy A Lynch(
Book
)
5 editions published between 1995 and 2002 in English 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."
5 editions published between 1995 and 2002 in English 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."
Time bounds for realtime process control in the presence of timing uncertainty
by
Hagit Attiya(
Book
)
3 editions published between 1989 and 1991 in English and held by 11 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."
3 editions published between 1989 and 1991 in English and held by 11 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."
Hierarchical correctness proofs for distributed algorithms
by Mark R Tuttle(
Book
)
1 edition published in 1987 in English 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
1 edition published in 1987 in English 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
The Byzantine firing squad problem
by
James E Burns(
Book
)
1 edition published in 1985 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 1985 in English and held by 8 WorldCat member libraries worldwide
Modelling shared state in a shared action model
by K. J Goldman(
Book
)
2 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide
2 editions published in 1990 in English and held by 8 WorldCat member libraries worldwide
The need for headers : an impossibility result for communication over unreliable channels
by
Alan Fekete(
Book
)
2 editions published in 1990 in English and held by 8 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
2 editions published in 1990 in English and held by 8 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
Correctness conditions for highly available replicated databases
by
Nancy A Lynch(
Book
)
1 edition published in 1986 in English and held by 8 WorldCat member libraries worldwide
1 edition published in 1986 in English and held by 8 WorldCat member libraries worldwide
A serialization graph construction for nested transactions
by
Alan Fekete(
Book
)
2 editions published in 1990 in English and held by 8 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)
2 editions published in 1990 in English and held by 8 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)
A new faulttolerant algorithm for clock synchronization
by Jennifer Lundelius Welch(
Book
)
1 edition published in 1984 in English and held by 7 WorldCat member libraries worldwide
1 edition published in 1984 in English and held by 7 WorldCat member 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 7 WorldCat member libraries worldwide
1 edition published in 1982 in English and held by 7 WorldCat member libraries worldwide
Multilevel atomicity : a new correctness criterion for database concurrency control
by
Nancy A Lynch(
Book
)
2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
2 editions published in 1982 in English and held by 7 WorldCat member libraries worldwide
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Useful Links
Associated Subjects
Algorithms Artificial intelligence Computational complexity Computer algorithms Computer inputoutput equipment Computer network protocols Computer networks Computer programsVerification Computer science Computer software Computer storage devices Database management Data transmission systems Digital control systems Distributed databases Electronic data processingDistributed processing Electronic data processingDistributed processingMathematical models Electronic data processingDistributed processingReliability Engineering Faulttolerant computing Hybrid computers Inputoutput analysis Logic design Machine theory Mappings (Mathematics) Packet switching (Data transmission) Physics Realtime clocks (Computers) Realtime control Realtime data processing Reasoning Recursive functions Software engineering Structural control (Engineering) Temporal automata Transaction systems (Computer systems) Turing machines
Alternative Names
Lynch, N. 1948
Lynch, N. A. 1948
Lynch, Nancy.
Lynch, Nancy 1948
Lynch, Nancy A.
Lynch, Nancy Ann 1948
Languages
Covers