WorldCat Identities

Lynch, Nancy A. (Nancy Ann) 1948-

Overview
Works: 82 works in 175 publications in 1 language and 2,143 library holdings
Genres: Conference proceedings 
Roles: Editor, Creator
Classifications: QA76.9.D5, 004.36
Publication Timeline
Key
Publications about  Nancy A Lynch Publications about Nancy A Lynch
Publications by  Nancy A Lynch Publications by Nancy A Lynch
Most widely held works by Nancy A Lynch
Distributed algorithms by Nancy A Lynch ( Book )
24 editions published between 1996 and 2010 in English and Undetermined and held by 916 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 automata-theoretic 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 13-15, 2010 : proceedings by Nancy A Lynch ( )
4 editions published in 2010 in English and held by 332 WorldCat member libraries worldwide
Annotation
Hybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000 : proceedings by Nancy A Lynch ( Book )
17 editions published in 2000 in English and held by 287 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 )
5 editions published in 1994 in English and held by 197 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 37 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, real-time 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 223-25, 2000 : proceedings by HSCC 2000 ( Book )
3 editions published in 2000 in English and held by 23 WorldCat member libraries worldwide
Hybrid systems: computation and control : third international workshop ; proceedings ( Book )
2 editions published between 2000 and 2002 in English and held by 19 WorldCat member 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 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 multi-valued 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 "progress functions" providing measures of progress toward timing goals. The technique is illustrated with two examples, a simple resource manager and a two-process race system
Relativization of the theory of computational complexity by Nancy A Lynch ( Book )
8 editions published in 1972 in English and Undetermined and held by 15 WorldCat member libraries worldwide
Blum's machine-independent 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 complexity-determined reducibilities, the parallel notion to complexity classes for the relativized case. Truth-table 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 non-transitivity and bounds on the amount of help certain sets can provide. (Author)
The Theory of Timed I/O Automata, Second Edition by Dilsun Kaynar ( )
1 edition published in 2010 in English and held by 14 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, real-time operating systems, and automated control. Many applications involving timed systems have strong safety, reliability, and predictability req
Time bounds for real-time 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 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."
Distributed computing 24th international symposium ; proceedings ( Book )
2 editions published in 2010 in English and held by 10 WorldCat member libraries worldwide
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 input-output automaton. This simple, powerful model captures in a novel way the game-theoretical 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 input-output automaton model, and presents an interesting example of how this model can be used to construct such proofs
Modelling shared state in a shared action model by Kenneth J Goldman ( Book )
2 editions published in 1990 in English and held by 9 WorldCat member libraries worldwide
The input/output automation model of Lynch and Tuttle is extended to allow modelling of shared memory systems, as well as systems that include both shared memory and shared action communication. A full range of types of atomic accesses to shared memory is allowed from basic reads and writes to read-modify- write. As an example, Dijkstra's classical shared memory mutual exclusion algorithm is presented and proved correct. Keywords: Distributed computing; Distributed algorithms; Mutual exclusion; Input/output; Automata
Hybrid systems : computation and control ; third International Workshop, HSCC 2000, Pittburgh, PA, USA, March 23 - 25, 2000 ; proceedings ( )
1 edition published in 2000 in English and held by 8 WorldCat member libraries worldwide
Action transducers and timed automata by Nancy A Lynch ( Book )
4 editions published between 1992 and 1994 in English and held by 8 WorldCat member 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 )
3 editions published in 1995 in English and held by 8 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."
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
Correctness conditions are given which describe some of the properties exhibited by highly available distributed database systems such as the SHARD (System for Highly Available Replicated Data) system currently being developed at Computer Corporation of America. This system allows a database application to continue operation in the face of communication failures, including network partitions. A penalty is paid for this extra availability: the usual correctness conditions, serializability of transactions and preservation of integrity constraints, are not guaranteed. However, it is still possible to make interesting claims about the behavior of the system. The kinds of claims which can be proved include bounds on the costs of violation of integrity constraints, and fairness guarantees. In contrast to serializability's all-or-nothing character, this work has a continuous flavor: small changes in available information lead to small perturbations in correctness conditions. This work is novel, because there has been very little previous success in stating interesting properties which are guaranteed by nonserializable systems. (Author)
Impossibility of distributed consensus with one faulty process by Michael J Fischer ( Book )
1 edition published in 1982 in English and held by 8 WorldCat member libraries worldwide
The consensus problem involves an asynchronous system of processes, some of which may be unreliable. The problem is for the reliable processes to agree on a binary value. We show that every protocol for this problem has the possibility of nontermination, even with only one faulty process. By way of contrast, solutions are known for the synchronous case, the Byzantine Generals problem. (Author)
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 8 WorldCat member libraries worldwide
Multilevel atomicity, a new correctness criteria for database concurrency control, is defined. It weakens the usual notion of serializability by permitting controlled interleaving among transactions. It appears to be especially suitable for applications in which the set of transactions has a natural hierarchical structure based on the hierarchical structure of an organization. A characterization for multilevel atomicity, in terms of absence of cycles in a dependency relation among transaction steps, is given. Some remarks are made concerning implementation. (Author)
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.67 (from 0.47 for Hybrid sys ... to 0.95 for Relativiza ...)
Alternative Names
Lynch, N., 1948-
Lynch, N. A. 1948-
Lynch, Nancy.
Lynch, Nancy, 1948-
Lynch, Nancy A.
Lynch, Nancy Ann 1948-
Languages
English (93)
Covers