WorldCat Identities

Lynch, Nancy A. (Nancy Ann) 1948-

Overview
Works: 171 works in 442 publications in 2 languages and 2,872 library holdings
Genres: Conference papers and proceedings  Academic theses 
Roles: Author, Editor, htt, Contributor, Other
Classifications: QA76.9.A43, 005.276
Publication Timeline
.
Most widely held works about Nancy A Lynch
 
Most widely held works by Nancy A Lynch
Distributed algorithms by Nancy A Lynch( )

36 editions published between 1996 and 2010 in English and Undetermined and held by 1,087 WorldCat member libraries worldwide

The presentation is completely rigorous, yet is intuitive enough for immediate comprehension. This book familiarizes readers with important problems, algorithms, and impossibility results in the area: readers can then recognize the problems when they arise in practice, apply the algorithms to solve them, and use the impossibility results to determine whether problems are unsolvable
Distributed computing 24th international symposium ; proceedings by Nancy A Lynch( )

17 editions published in 2010 in English and German and held by 519 WorldCat member libraries worldwide

DISC, the International Symposium on DIStributed Computing, is an inter- tional forum on the theory, design, analysis, implementation and application of distributed systems and networks. DISC is organized in cooperation with the European Association for Theoretical Computer Science (EATCS). This volume contains the papers presented at DISC 2010, the 24th Inter- tional Symposium on Distributed Computing, held on September 13-15,2010 in Cambridge, Massachusetts. The volume also includes the citation for the 2010 Edsger W. Dijkstra Prize in Distributed Computing, jointly sponsored by DISC and PODC (the ACM Symposium on Principles of Distributed Computing), which was presented at PODC 2010 in Zurich to Tushar D. Chandra, Vassos Hadzilacos, and Sam Toueg for their work on failure detectors. Therewere135paperssubmittedtothesymposium(inadditiontherewere14 abstract-only submissions). The Program Committee selected 32 contributions out of the 135 full-paper submissions for regular presentations at the sym- sium. Each presentation is accompanied by a?fteen-page paper in this volume. Everysubmitted paper was read and evaluated by at least three members of the ProgramCommittee. The committee was assisted by more than 120 external - viewers. The Program Committee made its?nal decisions during the electronic meeting held on June 18-29, 2010. Revised and expanded versions of several selected papers will be consideredfor publication in a special issue of the journal Distributed Computing. TheprogramalsoincludedthreeinvitedlecturesbyRachidGuerraoui(EPFL, Switzerland), Barbara Liskov (MIT, USA), and Nitin Vaidya (University of Il- nois, USA)
Hybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000 : proceedings by Nancy A Lynch( )

28 editions published between 2000 and 2002 in English and held by 477 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 )

9 editions published in 1994 in English and held by 203 WorldCat member libraries worldwide

The theory of timed I/O automata by Dilsun K Kaynar( Book )

3 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, 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 23-25, 2000 Proceedings( )

1 edition published in 2002 in English and held by 26 WorldCat member libraries worldwide

Relativization of the theory of computational complexity by Nancy A Lynch( Book )

11 editions published in 1972 in English and Undetermined and held by 19 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)
Using mappings to prove timing properties by Nancy A Lynch( Book )

10 editions published between 1989 and 1992 in English and held by 19 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 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. The technique is illustrated with two simple examples, a resource manager and a signal relay. Keywords: Formal specification; Formal verification; Assertional reasoning, Possibilities mappings; Timed automata; I/O automata. (kr)
Hybrid I/O automata by Nancy A Lynch( Book )

8 editions published between 1995 and 2002 in English and Undetermined and held by 15 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 real-time process control in the presence of timing uncertainty by Hagit Attiya( Book )

7 editions published between 1989 and 1991 in English and held by 14 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."
Applications of the Theory of Distributed and Real Time Systems to the Development of Large- Scale Timing Based Systems( )

12 editions published between 1996 and 1998 in English and held by 12 WorldCat member libraries worldwide

We continued our project on the IOA language and toolset, which are designed to support our formal approach to distributed system design and analysis. The design of the IOA language is substantially complete, and appears in a language manual on the web. This quarter, work continued on the development of tools for the IOA language; our toolset will include a parser and static semantic checker, composition routine, support for levels of abstraction interfaces with theorem provers and model checkers, a simulator, and a code generator for real distributed code
Using mappings to prove timing properties by Nancy A Lynch( Book )

6 editions published between 1989 and 1992 in English and held by 11 WorldCat member libraries worldwide

Action transducers and timed automata by Nancy A Lynch( Book )

8 editions published between 1992 and 1996 in English and held by 11 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."
Impossibility of distributed consensus with one faulty process by Michael J Fischer( Book )

5 editions published in 1982 in English and held by 10 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)
Concurrency control for resilient nested transactions by Nancy A Lynch( Book )

5 editions published between 1983 and 1986 in English and held by 10 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 event-state algebra levels, each of which simulates the previous one in a straightforward way. (Author)
Multilevel atomicity : a new correctness criterion for database concurrency control by Nancy A Lynch( Book )

5 editions published in 1982 in English and held by 10 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)
Proceedings of the fifteenth annual ACM Symposium on Theory of Computing : Boston, Massachusetts, April 25-27, 1983 by David S Johnson( )

1 edition published in 1983 in English and held by 9 WorldCat member libraries worldwide

Probabilistic analysis of a network resource allocation algorithm by Nancy A Lynch( Book )

7 editions published between 1983 and 1985 in English and held by 9 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 J. E Burns( Book )

3 editions published in 1985 in English and held by 9 WorldCat member libraries worldwide

A new problem, the Byzantine Firing Squad problem, is defined and solved in two versions, Permissive and Strict. Both problems provide for synchronization of initially unsynchronized processors in a synchronous network, in the absence of a common clock and in the presence of a limited number of faulty processors. Solution are given which take the same number of rounds as Byzantine Agreement but might transmit r times as many bits, where r is the number of rounds used. Additional solutions are provided which use at most one (Permissive) or two (Strict) additional rounds and send at most n sub 2 bits plus four times the number of bits sent by a chosen Byzantine Agreement algorithm. Additional keywords: Computer communications. (Author)
Hierarchical correctness proofs for distributed algorithms by Mark R Tuttle( Book )

3 editions 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
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.46 (from 0.23 for Distribute ... to 0.95 for Applicatio ...)

Distributed algorithms
Covers
Distributed computing 24th international symposium ; proceedingsHybrid systems : computation and control : Third International Workshop, HSCC 2000, Pittsburgh, PA, USA, March 23-25, 2000 : proceedingsAtomic transactionsThe theory of timed I/O automata
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 ríomheolaí Meiriceánach

Nancy Lynch US-amerikanische Informatikerin

Nancy Lynchová

Ненсі Лінч

Нэнси Линч американский учёный

ננסי לינץ'

نانسى لينش

نانسي لينش

نانسی لینچ دانشمند علوم کامپیوتر آمریکایی

நான்சி லின்ச்

ナンシー・リンチ

南希·林奇

Languages
English (182)

German (1)