In this paper, we present FASE (Faster Asynchronous Systems Evaluation), a
tool for evaluating the worst-case efficiency of asynchronous systems. The tool
is based on some well-established results in the setting of a timed process
algebra (PAFAS: a Process Algebra for Faster Asynchronous Systems). To show the
applicability of FASE to concrete meaningful examples, we consider three
implementations of a bounded buffer and use FASE to automatically evaluate
their worst-case efficiency.
TACS is an extension of CCS where upper time bounds for delays can be
specified. Luettgen and Vogler defined three variants of bismulation-type
faster-than relations and showed that they all three lead to the same preorder,
demonstrating the robustness of their approach. In the present paper, the
operational semantics of TACS is extended; it is shown that two of the variants
still give the same preorder as before, underlining robustness. An explanation
is given why this result fails for the third variant.