Browsing CS Technical Reports by Author "Landweber, Lawrence"
Now showing items 19 of 9

An Axiomatic Approach to Equivalence of StraightLine Programs with Structured Variables
Hoffmann, Christoph; Landweber, Lawrence (University of WisconsinMadison Department of Computer Sciences, 1974)A program scheme which models straight line code admitting structured variables such as arrays, lists, queues, etc. is considered. A set of expressions is associated with a program reflecting the inputoutput tranformations. ... 
The Charlotte Distributed Operating System Part IV of the First Report on the Crystal Project
Finkel, Raphael A; Solomon, Marvin H; DeWitt, David J; Landweber, Lawrence (University of WisconsinMadison Department of Computer Sciences, 1983) 
The Crystal Nugget  Part I of the First Report on the Crystal Project
Cook, Robert P; Finkel, Raphael A; DeWitt, David J; Landweber, Lawrence; Virgilio, Thomas (University of WisconsinMadison Department of Computer Sciences, 1983) 
The Crystal Nuggetmaster  Part II of the First Report on the Crystal Project
Cook, Robert P; Finkel, Raphael A; Gerber, Bob; DeWitt, David J; Landweber, Lawrence (University of WisconsinMadison Department of Computer Sciences, 1983) 
Finite Delay Solutions for Sequential Conditions
Hosch, F.; Landweber, Lawrence (University of WisconsinMadison Department of Computer Sciences, 1972) 
On the Structure of Sets in NP and Other Complexity Classes
Landweber, Lawrence; Lipton, Richard; Robertson, Edward (University of WisconsinMadison Department of Computer Sciences, 1978)A simple technique is developed for manipulating the relative complexity of sets with respect to polynomial time reducibility. One application is the definition of a minimal pair (with respect to polynomial time reducibility) ... 
Properties of Conflict Free and Persistent Petri Nets
Landweber, Lawrence; Robertson, Edward (University of WisconsinMadison Department of Computer Sciences, 1975)Petri nets have been extensively studied because of their suitabi1ity as models for asynchronous computing. Despite this effort, the mathematical properties of Petri nets are not very well understood. In this paper, we ... 
Properties of Vector Addition Systems
Landweber, Lawrence (University of WisconsinMadison Department of Computer Sciences, 1975)We consider vector addition systems (VAS), a model of asynchronous computation which is equivalent to the Petri net model. Reachability is not known to be decidable for arbitrary VAS. The best known lower bound for the ... 
Wisconsin Modula  Part III of the First Report on the Crystal Project
Finkel, Raphael A; Cook, Robert P; DeWitt, David J; Hall, Nancy E; Landweber, Lawrence (University of WisconsinMadison Department of Computer Sciences, 1983)