Abstract

A simple efficiency preorder for CCS processes is introduced, in which p ! q means that q is at least as fast as p, or more generally, p uses at least as much resources as q. It is shown to be preserved by all CCS contexts except summation and it is used to analyse a non-trivial example: different implementations of a bounded buffer. Finally a sound and complete proof system for finite processes is given. This paper appeared earlier in [1] and [2]. This version of the paper has been revised, corrected and extended to include more operators, more examples and some additional remarks and observations by the first author. Hence all errors are entirely his responsiblity. Most of this work was done while the first author was at the University of Sussex and supported by SERC grant GR/D 97368 of the Science and Engineering Research Council of Great Britain. y The second author would like to acknowledge the support of ESPIRIT II. 1 Introduction A large number of behavioural equivale...

Citations