Abstract.
A preorder based on execution speed, called performance preorder, is introduced for a simple process algebra with durational actions. Two processes \(E\) and \(F\) are related -\( E \sqsubseteq_p F\)- if they have the same functionality (in this case, we have chosen strong bisimulation equivalence) and \(E\) is at least as fast as \(F\). Hence, this preorder supports the stepwise refinement “from specification to implementation” by increasing efficiency while retaining the same functionality. We show that the problem of finding faster implementations for a specification is connected to the problem of finding more distributed implementations of the same specification. Both performance preorder and the induced equivalence, called competitive equivalence, are provided with sound and complete axiomatizations for finite agents.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: January 2, 1996 / October 31, 1996
Rights and permissions
About this article
Cite this article
Corradini, F., Gorrieri, R. & Roccetti, M. Performance preorder and competitive equivalence. Acta Informatica 34, 805–835 (1997). https://doi.org/10.1007/s002360050107
Issue Date:
DOI: https://doi.org/10.1007/s002360050107