Abstract
Given a set of processes and a set of tests on these processes we show how to define in a natural way three different equivalences on processes. These equivalences are applied to a particular language CCS. We give associated complete proof systems and fully abstract models. These models have a simple representation in terms of trees.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Darondeau,Ph. An enlarged definition and complete axiomatization of observational congruence of finite processes, LNCS 137, pp. 47–62, 1982.
De Nicola,R. and Hennessy,M. Testing equivalences for processes, Technical Report CSR-123-82, University of Edinburgh.
Goguen,J.A., Thatcher,J.W., Wright,J.B. Initial algebra semantics and continuous algebras, JACM Vol. 24, No. 1, pp. 68–95, 1977.
Guessarian,I. Algebraic semantics, LNCS 99, 1981.
Hennessy,M. Powerdomains and nondeterministic recursive definitions, LNCS 137, pp. 178–193, 1982.
Hennessy,M., Plotkin,G. A term model for CCS, LNCS 88, pp. 261–274, 1980.
Hennessy,M., Milner,R. On observing nondeterminism and concurrency, LNCS 85, pp. 299–309, 1980.
Hoare,C.A.R. A model for communicating sequential processes, Technical Monograph Prg-22, Computing Laboratory, University of Oxford, 1981.
Hoare,C.A.R., Brookes,S.D. and Roscoe,A.D. A theory of communicating sequential sequential processes, Technical Monograph Prg-16, Computing Laboratory, University of Oxford, 1981.
Kennaway,J.K. and Hoare,C.A.R. A theory of nondeterminism, LNCS 85, pp. 338–350, 1980.
Kennaway,J.K. Formal semantics of nondeterminism and parallelism, Ph.D. thesis, University of Oxford, 1981.
Milner, R. A calculus of communicating systems, LNCS 92, 1980.
Plotkin,G. A powerdomain construction, SIAM J. on Computing, No. 5, pp. 452–486, 1976.
Rounds,W.C., and Brookes,S.D. Possible futures, acceptances, refusals and communicating processes, Proc. of 22nd FOCS Annual Symposium, Nashville Tennessee, October 1981.
Scott, D.S. Data types as lattices, SIAM J. on Computing, Vol. 5, No. 3, 1976.
Smyth,M.B. Power domains, JCSS, Vol. 2, pp. 23–36, 1978.
Stoy,J. Denotational semantics: the Scott-Strachey approach to programming language theory, MIT Press, 1977.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Nicola, R., Hennessy, M.C.B. (1983). Testing equivalences for processes. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036936
Download citation
DOI: https://doi.org/10.1007/BFb0036936
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive