Abstract
The problem of comparing and analyzing the relationships between distributed programs written in the same concurrent programming language is addressed. It arises each time one wants to establish program correctness with respect to a notion of “being an approximation of”. We define a testing scenario for PAL, a process algebra which is obtained by embedding the Linda primitives for interprocess communication in a CSP like process description language. We present a proof system for PAL processes which is sound and complete with respect to the behavioural relation and illustrate how it works by giving a small example.
Work partially supported by EEC within the HCM Project EXPRESS, and by CNR within the project “Specifica ad Alto Livello e Verifica di Sistemi Digitali”.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L.Aceto, A.Ingolfsdottir. A Theory of Testing for ACP. Proceedings of CONCUR 91, J.C.M. Baeten and J.F. Groote, editors, LNCS 527, pages 78–95, Springer-Verlag, Berlin, 1991.
J. Bergstra, J.W. Klop. Process Algebra for Synchronous Communication. Information and Control, 60:109–137, 1984.
J.A. Bergstra, J.W. Klop, J.V. Tucker. Process Algebra with Asynchronous Communication Mechanisms. Proceedings of Seminar in Concurrency, S.D. Brookes, A.W. Roscoe and G. Winskel, editors, LNCS 197, pages 76–95, Springer-Verlag, Berlin, 1985.
F.S. de Boer, J.W. Klop, C. Palamidessi. Asynchronous Communication in Process Algebra. Proceedings of LICS, 1992.
F.S. de Boer, C. Palamidessi. On the asynchronous nature of communication in concurrent logic languages: a fully abstract model based on sequences. Proceedings of CONCUR'90, LNCS 458, pages 99–114, Springer-Verlag, Berlin, 1990.
G. Boudol. Asynchrony in the π-calculus. Unpublished manuscript, INRIA Sophia-Antipolis, 1992.
N. Carriero, D. Gelernter. Linda in Context. Communications of the ACM, 32(4):444–458, 1989.
N. Carriero, D. Gelernter, J. Leichter. Distributed Data Structures in Linda. Proceedings of the ACM Symposium on Principles of Programming Languages (St. Petersburg, Fla., Jan.13–15), ACM, New York, pages 236–242, 1986.
R. De Nicola, M.C.B. Hennessy. Testing Equivalence for Processes. Theoretical Computers Science, 34:83–133, 1984.
R. De Nicola, M.C.B. Hennessy. CCS without τ's. Proceedings of TAPSOFT'87, LNCS 249, pages 138–152, 1987.
R. De Nicola, R. Pugliese. Testing Linda: an Observational Semantics for an Asynchronous Language. Research Report: SI/RR-94/06, Dipartimento di Scienze dell'Informazione, Università di Roma “La Sapienza”, 1994.
R. De Nicola, R. Pugliese. An Observational Semantics for Linda. Proceedings of STRICT'95, pp.129–143, Jorg Desel(ed.), Series Workshops in Computing, Springer-Verlag, Berlin, 1995.
D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.
M. Hansen, H. Huttel, J. Kleist. Bisimulations for Asynchronous Mobile Processes. Draft, Department of Mathematics and Computer Science Aalborg University, 1994.
M.C.B. Hennessy. Algebraic Theory of Processes. The MIT Press, 1988.
M.C.B. Hennessy, A. Ingolfsdottir. A theory of communicating processes with value-passing. Information and Computation, 107(2)202–236, 1993.
M.C.B. Hennessy, A. Ingolfsdottir. Communicating processes with value-passing and assignment. Journal of Formal Aspects of Computing Science, pages 3:346–366, 1993.
C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.
K. Honda, M. Tokoro. An Object Calculus for Asynchronous Communication. Proceedings of ECOOP'91, LNCS 512, pages 133–147, Springer-Verlag, Berlin, 1991.
K. Honda, M. Tokoro. On Asynchronous Communication Semantics. Proceedings of ECOOP'91, LNCS 612, pages 21–51, Springer-Verlag, Berlin, 1991.
A. Ingolfsdottir. Semantic Models for Communicating Processes with Value-Passing. Ph.D. Thesis, University of Edinburgh, 1994.
H. Jifeng, M.B. Josephs, C.A.R. Hoare. A Theory of Synchrony and Asynchrony. Proceedings of the IFIP Working Conference on Programming Concepts and Methods, pages 446–465, 1990.
R. Milner. Communication and Concurrency. Prentice Hall International, 1989.
R. Milner, J. Parrow, D. Walker. A calculus of mobile processes, (Part I and II). Information and Computation, 100:1–77, 1992.
G.D. Plotkin. A Structural Approach to Operational Semantics. Technical Report DAIMI FN-19, Aarhus University, Dep. of Computer Science, Denmark, 1981.
R. Pugliese. A Process Calculus with Asynchronous Communications. In Proc. Italian Conference on Theoretical Computer Science '95, Ravello, 1995. (to appear)
R. Pugliese. Semantic Theories for Asynchronous Languages. Ph.D. Thesis, Draft, Università di Roma “La Sapienza”, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Nicola, R., Pugliese, R. (1996). A process algebra based on Linda. In: Ciancarini, P., Hankin, C. (eds) Coordination Languages and Models. COORDINATION 1996. Lecture Notes in Computer Science, vol 1061. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61052-9_45
Download citation
DOI: https://doi.org/10.1007/3-540-61052-9_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61052-6
Online ISBN: 978-3-540-49936-7
eBook Packages: Springer Book Archive