In our paper "Uniformity and the Taylor expansion of ordinary lambda-terms" (with Laurent Regnier), we studied a translation of lambda-terms as infinite linear combinati...
We focus on tandem queues with subexponential service time distributions. We assume that number of customers in front of the first station is infinite and there is infinite room f...
Model Checking of Infinite Specifications Daniel Jackson School of Computer Science Carnegie Mellon University Pittsburgh, PA A new method for analyzing specifications in languages...
It is consistent that there is a set mapping from the four-tuples of n into the finite subsets with no free subsets of size tn for some natural number tn. For any n < it is con...
In the past 5 years, a series of verification algorithms has been proposed for infinite Markov chains that have a finite attractor, i.e., a set that will be visited infinitely oft...