Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
Marta Z. Kwiatkowska, Gethin Norman, Jeremy Sprost...
Davies and Wakerly show that Byzantine fault tolerance can be achieved by a cascade of broadcasts and middle value select functions. We present an extension of the Davies and Waker...
Paul S. Miner, Alfons Geser, Lee Pike, Jeffrey Mad...
In reviewing topics in simulation output analysis, we advocate univariate analysis, micro/macro replications based on fixed sample sizes, overlapping batches, batch sizes based on...
We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions o...
1 The sequence of nucleotides that makes up a DNA molecule encodes the characteristics of living things. Bioinformatics offers sophisticated methods to search for and compare nucl...