Abstract
The main point of this paper is that one can develop an adequate version of CCS which does not use the special combinator τ for internal actions. Instead, the choice operator +, whose semantics is somewhat unclear, is replaced by two new choice operators ⊕ and [], representing internal and external nondeterminism respectively. The operational semantics of the resulting language is simpler and the definition of testing preorders is significantly cleaner. The essential features of the original calculus are kept; this is shown by defining a translation from CCS to the new language which preserves testing preorders.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Austry, D. and Boudol, G. Algebre de Processus et Synchronization. Theoret. Comput. Sci. Vol. 30, No. 1 North Holland, Amsterdam, (1984).
de Bakker, J. and Zucker, J., Processes and the Denotational Semantics of Concurrency. Information and Control, Vol 44, Nos. 1–2, pp.136–176, (1982).
Brookes,S.D. A Model for Communicating Sequential Processes. Ph.D. Thesis, University of Oxford. Also Carnegie Mellon University Internal Report, CMU-CS-149, (1983).
Brookes, S.D., Hoare, C.A.R. and Roscoe, A.D. A Theory of Communicating Sequential Processes. Journal of ACM, Vol. 31, No. 3, pp. 560–599, (1984).
Begstra, J. and Klop, G. Process Algebra for Synchronous Communication, Information and Control, Vol 60, pp.109–137, (1984).
De Nicola, R. and Hennessy, M. Testing Equivalences for Processes. Theoret. Comput. Sci., Vol.34, pp. 83–133, North Holland, Amsterdam, (1984).
De Nicola, R. Two Complete Set of Axioms for a Theory of Communicating Sequential Processes. Information and Control, Vol 64, Nos. 1–3, pp.136–176, (1985).
De Nicola, R. Fully Abstract Models and Testing Equivalences for Communicating Processes. Ph.D. Thesis, University of Edinburgh CST-36-85, (1985).
Goguen, J.A., Thatcher, J.W., Wagner, E.G. and Wright, J.B. Initial Algebra Semantics and Continuous Algebras. Journal of ACM, Vol. 24, No. 1, pp. 68–95, (1977).
Guessarian, I. Algebraic Semantics. LNCS 99, (1981).
Hennessy, M. Synchronous and Asynchronous Experiments on Processes. Information and Control Vol. 59, Nos. 1–3, pp. 36–83, (1983).
Hennessy,M. An Algebraic Theory of Processes. Lecture Notes, Aarhus University, (1985).
Hennessy, M., Acceptance Trees, Journal of ACM, Vol. 32, No 4, pp. 896–928, (1985).
Hennessy, M., Milner, R. Algebraic Laws for Nondeterminism and Concurrency. Journal of ACM, Vol.32, No. 1, pp. 137–161, (1985).
Hoare,C.A.R. Communicating Sequential Processes. Prentice Hall (1985).
International Standard Organization, LOTOS-A Formal Description Technique. Internal Report Twente University of Technology and ISO/TC97/SC21 Draft Proposal 8807, (1986)
Milner,R. A Calculus of Communicating Systems, LNCS 92, (1980).
Milne, G. CIRCAL and the Representation of Communication, Concurrency and Time. ACM Toplas Vol. 7, No. 2, pp. 270–298, (1985).
Olderog, E-R, Hoare C.A.R. Specification-Oriented Semantics for Communicating Processes, Acta Informatica Vol. 23, pp. 9–66, (1986).
Plotkin, G. A Structural Approach to Operational Semantics, Lecture Notes, Aarhus University, (1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Nicola, R., Hennessy, M. (1987). CCS without τ's. In: Ehrig, H., Kowalski, R., Levi, G., Montanari, U. (eds) TAPSOFT '87. CAAP 1987. Lecture Notes in Computer Science, vol 249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17660-8_53
Download citation
DOI: https://doi.org/10.1007/3-540-17660-8_53
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17660-2
Online ISBN: 978-3-540-47746-4
eBook Packages: Springer Book Archive