Abstract.
A timed CCS-like process algebra PAFAS and a testing scenario are developed for evaluating the temporal worst-case efficiency of asynchronous concurrent systems. Each action is associated with a maximal time delay, which allows components to work with arbitrary relative speeds; for simplicity, the maximal delay is 1 or 0, but time is continuous. The canonical testing preorder associated to our timed testing compares worst-case efficiency; we show that this efficiency preorder can equivalently be defined considering only discrete time, which is of course much simpler. Then we characterize the efficiency preorder with some kind of refusal traces; despite the rather weak control an asynchronous test environment has, this gives quite detailed insight into the temporal system behaviour. Since the preorder is not a precongruence for choice, we refine it to the efficiency precongruence, which is a precongruence for all operators of the algebra including recursion.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 6 March 2001 / 8 May 2002
RID="*"
ID="*" This work was supported by MURST project ‘Saladin: Software Architectures and Languages to Coordinate Distributed Mobile Components’ and by the Center of Eccellence for Research ‘DEWS: Architectures and Design Methodologies for Embedded Controllers, Wireless Interconnect and System-on-chip’
RID="**"
ID="**" This work was supported by the DFG-project ‘Halbordnungstesten’.
Rights and permissions
About this article
Cite this article
Corradini, F., Vogler, W. & Jenner, L. Comparing the worst-case efficiency of asynchronous systems with PAFAS. Acta Informatica 38, 735–792 (2002). https://doi.org/10.1007/s00236-002-0094-3
Issue Date:
DOI: https://doi.org/10.1007/s00236-002-0094-3