Nancy Ann Lynch ( born Nancy Ann Lynch ; born January 19, 1948) - American scientist, professor of computer science and engineering at the Massachusetts Institute of Technology , known primarily for - a generalization of Mealy automata to distributed algorithms , which allows formally demonstrating their correctness with the help of hierarchical evidence [3] . Today, there are many varieties of I / O automata: , , probabilistic and dynamic [4] , all created by Lynch herself and her staff. The latest for 2016 were proposed dynamic I / O automata, which simulate dynamic systems and allow the creation and destruction of automata as they are computed, which significantly increases their and brings the formalism closer to modern software. Dynamic I / O machines can merge into a hierarchical system, run in parallel, rename and hide events, generate new automata and maintain monotony through semantic typing (if you replace an automaton fragment with another that supports only a subset of the original event sequences, then at the system level it can lead only with a decrease in the number of possible sequences of events) [5] .
| Nancy Ann Lynch | |
|---|---|
| Nancy ann lynch | |
| Date of Birth | |
| Place of Birth | |
| A country |  USA |
| Scientific field | computer science |
| Place of work | Tufts , South. California , Georgia , Massachusetts |
| Alma mater | Massachusetts Institute of Technology |
| Academic degree | Ph.D |
| Academic title | Professor |
| supervisor | |
| Known as | I / O author |
| Awards and prizes | Piora Prize (2010) [2] Dijkstra Prize (2001, 2007) Knut Award (2007) Van Weingaarden Prize (2006) |
| Site | people.csail.mit.edu/lyn ... |
In addition to a notable contribution to the theory of automata , Nancy Lynch wrote several books, including a well-known textbook on distributed algorithms [6] , which is currently slightly outdated and still used in the educational process, but being supplanted, for example, by V. Fokkin’s textbook [7] offering a more modern and fresh look to this rapidly developing area.
Nancy Lynch's thesis was called “Relativization of the theory of computational complexity ” ( English Relativization of the Theory of Computational Complexity , 1972) [8] . Lynch is the author and co-author of more than 100 journal and nearly 200 conference articles [9] . She supervised at least 28 successfully defended graduate students [8] . She is also on the list of members of the National Academy of Sciences of the USA (since 2016) [10] , the National Engineering Academy of the USA (since 2001) [11] and the Association for Computing Machinery (since 1997) [12] and the winner of a number of prestigious academic awards.
Notes
- ↑ SNAC - 2010.
- ↑ IEEE Emanuel R. Piore Award Recipients (inaccessible link) . Ieee . The appeal date was December 31, 2010. Archived November 24, 2010
- Ancy Nancy A. Lynch, Mark R. Tuttle, Hierarchical Correctity Proofs for Distributed Algorithms . PODC 1987: 137–151.
- Ancy Nancy A. Lynch, Input / Output Automata: Basic, Timed, Hybrid, Probabilistic, Dynamic, ... , CONCUR 2003: 187-188.
- C. Paul C. Attie, automata: Dynamic input / output automata: Inf. Comput. 249: 28-75 (2016) ( preprint )
- ↑ Nancy A. Lynch, Distributed Algorithms. 1996 Morgan Kaufmann, ISBN 1-55860-348-4 .
- ↑ Wan Fokkink Distributed Algorithms: An Intuitive Approach, MIT Press, 2013. ISBN 0262026775
- ↑ 1 2 Nancy Ann Lynch at the Mathematics Genealogy Project .
- ↑ Nancy A Lynch on DBLP .
- ↑ Nancy A. Lynch (Eng.)
- ↑ NAE Members Directory - Dr. Nancy A. Lynch . NAE . The appeal date is December 31, 2010.
- ↑ Nancy A Lynch - Award Winner . Association for Computing Machinery . The appeal date is October 31, 2013.