An efficiency preorder for processes
A simple efficiency preorder for CCS processes is introduced in which \(p\preceq 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: two different implementations of a bounded buffer. Finally, we give a sound and complete proof system for finite processes.
scientific article; zbMATH DE number 567319