Browsing Department of Electrical Engineering and Computer Sciences by Title

Now showing items 98-108 of 108

    • The Theory of Timed I/O Automata 

      Kaynor, Dilsun K.; Lynch, Nancy; Segala, Roberto; Vaandrager, Frits (2005-03-02)
      This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed systems.

    • Timeout Order Abstraction for Time-Parametric Verification of Loosely Synchronized Real-Time Distributed Systems 

      Umeno, Shinya; Lynch, Nancy Ann (Artist Consortium, 2009-12)
      We present timeout order abstraction (TO-abstraction), a technique to systematically abstract a given loosely synchronized real-time distributed system (LSRTDS) into an untimed model. We define the subclass of LSRTDS’s ...

    • Trade-offs between selection complexity and performance when searching the plane without communication 

      Lenzen, Christoph; Newport, Calvin Charles; Lynch, Nancy Ann; Radeva, Tsvetomira T. (Association for Computing Machinery (ACM), 2014-07)
      We argue that in the context of biology-inspired problems in computer science, in addition to studying the time complexity of solutions it is also important to study the selection complexity, a measure of how likely a given ...

    • A (Truly) Local Broadcast Layer for Unreliable Radio Networks 

      Lynch, Nancy; Newport, Calvin (2015-05-18)
      In this paper, we implement an efficient local broadcast service for the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Our local broadcast service offers ...

    • A (Truly) Local Broadcast Layer for Unreliable Radio Networks 

      Newport, Calvin Charles; Lynch, Nancy Ann (Association for Computing Machinery (ACM), 2015-07)
      In this paper, we implement an efficient local broadcast service for the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Our local broadcast service offers ...

    • Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-06-19)
      We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automataframework of Lynch, Segala, and Vaandrager. This framework providestools for arguing rigorously ...

    • Using Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2005-08-19)
      We demonstrate how to carry out cryptographic security analysis ofdistributed protocols within the Probabilistic I/O Automata frameworkof Lynch, Segala, and Vaandrager.This framework provides tools for arguing rigorously ...

    • Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2007-02-16)
      The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on implementation ...

    • Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-06-20)
      The Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about theircorrectness using multiple levels of abstraction, based on implementation ...

    • Using Task-Structured Probabilistic I/O Automata to Analyze an Oblivious Transfer Protocol 

      Canetti, Ran; Cheung, Ling; Kaynar, Dilsun; Liskov, Moses; Lynch, Nancy; e.a. (2006-03-08)
      AbstractThe Probabilistic I/O Automata framework of Lynch, Segala and Vaandrager provides tools for precisely specifying protocols and reasoning about their correctness using multiple levels of abstraction, based on ...

    • Virtual Mobile Nodes for Mobile Ad Hoc Networks 

      Dolev, Shlomi; Gilbert, Seth; Lynch, Nancy A.; Schiller, Elad; Shvarstman, Alex A.; e.a. (2004-02-26)
      One of the most significant challenges introduced by mobile networks is the difficulty in coping withthe unpredictable movement of mobile nodes. If, instead, the mobile nodes could be programmed totravel through the world ...