http://hdl.handle.net/1813/5603 http://dspace.library.cornell.edu/retrieve/32120 http://hdl.handle.net/1813/5603 Search the Channel search http://dspace.library.cornell.edu/simple-search http://hdl.handle.net/1813/10810 Title: A Linear List Merging Algorithm <br/> <br/>Authors: Hopcroft, John E.; Ullman, Jeffrey D. <br/> <br/>Abstract: A linear list merging algorithm and its analysis is presented. Starting with n lists, each containing a single element, the algorithm will execute an arbitrary sequence of requests to merge lists and to find the name of the list currently containing a given element. If the length of the sequence of requests is bounded by a constant times n, then the execution time of the algorithm on a random access computer is bounded by a constant times n. http://hdl.handle.net/1813/7516 Title: On the Modelling Power of Petri Nets <br/> <br/>Authors: Meiling, Erik <br/> <br/>Abstract: The behavior of a Petri net is expressed as a formal language. Certain families of Petri net languages are characterized by propositions similar to the classical pumping theorems. The results are used to give examples of behaviors that cannot be expressed by languages in these families. http://hdl.handle.net/1813/7515 Title: Cand and Cor Before and Then or Else in Ada <br/> <br/>Authors: Gries, David <br/> <br/>Abstract: NO ABSTRACT SUPPLIED http://hdl.handle.net/1813/7514 Title: A Proof Technique for Communicating Sequential Processes(With an Example) <br/> <br/>Authors: Levin, Gary Marc <br/> <br/>Abstract: We present proof rules for an extension of the Communicating Sequential Processes proposed by Hoare. The send and receive statements are treated symmetrically, simplifying the rules and allowing send to appear in guards. An example is given to explain the use of the technique. This is an outline of a substantial part of a PhD thesis that is expected to be completed in June 1980.