Abstract
A simple efficiency preorder for CCS processes is introduced in whichp≲q means thatq is at least as fast asp, or more generally,p uses at least as much resources asq. 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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Proc. International Conference on Theoretical Aspects of Computer Software. (Lect. Notes Comput. Sci., vol. 526, pp. 152–175. Berlin Heidelberg New York: Springer 1991
Beaton, J., Bergstra, J.: Real time process algebra, Technical Report CWI Amsterdam, 1989
Cleaveland, R., Parrow, J., Steffen, B.: The concurrency workbench: A semantics-based verification tool for finite-state systems, Technical Report ECS-LFCS-89-83, University of Edinburgh, 1989
Davies, J., Schneider, S.: An introduction to timed CSP, Technical Report, PRG, Oxford, 1989
Gerth, R., Boucher, A.: A timed failures model for extended communicating sequential processes (Lect. Notes Comput. Sci., vol. 267, pp. 95–114. Berlin Heidelberg New York: Springer 1986
Hennessy, M.: Algebraic theory of processes. Cambridge, MA: MIT Press 1988
Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. J. ACM32(1), 137–161 (1985)
Hennessy, M., Regan, T.: A temporal process algebra. Technical Report 2/90, University of Sussex, 1990
C.A.R. Hoare: Communicating sequential processes. Englewood Cliffs, NJ: Prentice Hall 1985
Milner, R.: Calculi for synchrony and asynchrony. Theor. Comput. Sci.25, 267–310 (1983)
Milner, R.: Communicationa and concurrency. Englewood Cliffs, NJ: Prentice Hall 1989
Nicollin, X., Richier, J.L., Sifakis, J., Voiron, J.: ATP: An algebra for timed processes. Technical Report, Grenoble, 1989
Park, D.: Concurrency and automata on infinite sequences. (Lect. Notes Comput. Sci., vol. 104, pp. 167–183) Berlin Heidelberg New York: Springer 1980
Reed, G.M., Roscoe, A.: A timed model for communicating sequential processes (Lect. Notes Comput. Sci., vol. 226, pp. 314–323) Berlin Heidelberg New York: Springer 1986
Rudkin, S., Smith, C.R.: A temporal enhancement for LOTOS. British Telecom, 1988
Author information
Authors and Affiliations
Additional information
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.
The second author would like to acknowledge the support of the ESPRIT II Basic Research Action Concur.
Rights and permissions
About this article
Cite this article
Arun-Kumar, S., Hennessy, M. An efficiency preorder for processes. Acta Informatica 29, 737–760 (1992). https://doi.org/10.1007/BF01191894
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01191894