Abstract
A simple efficiency preorder for CCS processes is introduced in which p≲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 a sound and complete proof system for finite processes is given.
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
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Baeton, J. Bergstra: Real Time Process Algebra, Technical Report CWI Amsterdam, 1989.
R. Cleaveland, J. Parrow, B. Steffen: The Concurrency Workbench: A Semantics-Based Verification Tool for Finite-State Systems, Technical Report ECS-LFCS-89-83, University of Edinburgh, 1989.
J. Davies, S. Schneider: An Introduction to Timed CSP, Technical Report, PRG, Oxford, 1989.
R. Gerth, A. Boucher: A Timed Failures Model for Extended Communicating Sequential Processes, LNCS Lecture Notes in Computer Science 267, Springer-Verlag, 1986.
C.A.R. Hoare: Communicating Sequential Processes, Prentice Hall, 1985.
M. Hennessy: Algebraic Theory of Processes, MIT Press, 1988.
M. Hennessy, R. Milner: Algebraic Laws for Nondeterminism and Concurrency, Journal of the ACM, 32, 1, 137–161, 1985.
M. Hennessy, T. Regan: A Temporal Process Algebra, Technical Report 2/90, University of Sussex, 1990.
R. Milner: Calculi for Synchrony and Asynchrony, Theoretical Computer Science, 25, 267–310, 1983.
R. Milner: Communication and Concurrency, Prentice Hall, 1989.
X. Nicollin, J.L. Richier, J. Sifakis, J. Voiron: ATP: An Algebra for Timed Processes, Technical Report, Grenoble 1989.
D. Park: Concurrency and Automata on Infinite Sequences, LNCS Lecture Notes in Computer Science 104, Springer-Verlag 1980.
G.M. Reed, A. Roscoe: A Timed Model for Communicating Sequential Processes, LNCS Lecture Notes in Computer Science 226, Springer-Verlag, 1986.
S. Rudkin, C.R. Smith: A Temporal Enhancement for LOTOS, British Telecom, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Arun-Kumar, S., Hennessy, M. (1991). An efficiency preorder for processes. In: Ito, T., Meyer, A.R. (eds) Theoretical Aspects of Computer Software. TACS 1991. Lecture Notes in Computer Science, vol 526. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54415-1_45
Download citation
DOI: https://doi.org/10.1007/3-540-54415-1_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54415-9
Online ISBN: 978-3-540-47617-7
eBook Packages: Springer Book Archive