Abstract
One of the main aims of this paper is to show that the nature of the communication mechanism of concurrent constraint languages is essentially different from the classical paradigms of CCS, CSP and ACP. We define indeed a compositional semantics based on linear sequences, while more complicated structures, like trees and failure sets, are needed to model composition ally CCS, CSP and ACP. From this model we are able to derive a fully abstract semantics by imposing some saturation conditions, that model the monotonic nature of communication in concurrent constraint languages. Finally, we show that if we eliminate the consistency check, and drop the distinction between success and deadlock, then our model is isomorphic to the semantics based on Scott’s closure operators proposed in [SRP91].
Note: The research of Frank S. de Boer was partially supported by the Dutch REX (Research and Education in Concurrent Systems) project and by the ESPRIT project SPEC (Formal Methods and Tools for the Development of Distributed and Real-Time Systems).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.D. Brookes, C.A.R. Hoare, and W. Roscoe. A theory of communicating sequential processes. Journal of ACM, 31:499–560, 1984.
J.A. Bergstra and J.W. Klop. Process algebra: specification and verification in bisimulation semantics. In Mathematics and Computer Science II, CWI Monographs, pages 61–94. North-Holland, 1986.
K.L. Clark and S. Gregory. PARLOG: parallel programming in logic. ACM Trans. on Programming Languages and Systems, (8):1–49, 1986.
K.L. Clark. Predicate logic as a computational formalism. Res. Report DOC 79/59, Imperial College, Dept. of Computing, London, 1979.
J.W. de Bakker and J.N. Kok. Uniform abstraction, atomicity and contractions in the comparative semantics of Concurrent Prolog. In Proc. of the International Conference on Fiflh Generation Computer Systems, pages 347–355, Tokyo, Japan, 1988. OHMSHA, LTD. Extended Abstract, full version available as CWI report CS-8834.
F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Control flow versus logic: a denotational and a declarative model for Guarded Horn Clauses. In A. Kreczmar and G. Mirkowska, editors, Proc. of the Symposium on Mathematical Foundations of Computer Science, volume 379 of Lecture Notes in Computer Science, pages 165–176. Springer-Verlag, 1989.
F.S. de Boer, J.N. Kok, C. Palamidessi, and J.J.M.M. Rutten. Semantic models for a version of PARLOG. In Giorgio Levi and Maurizio Martelli, editors, Proc. of the Sixth International Conference on Logic Programming, Series in Logic Programming, pages 621–636, Lisboa, 1989. The MIT Press. Extended version in Theoretical Computer Science, 86(1):3–33, 1991.
F.S. de Boer and C. Palamidessi. Concurrent logic languages: Asynchronism and language comparison. In Proc. of the North American Conference on Logic Programming, Series in Logic Programming, pages 175–194. The MIT Press, 1990. Full version available as technical report TR 6/90, Dipartimento di Informatica, Università di Pisa.
F.S. de Boer and C. Palamidessi. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences. In J.C.M. Baeten and J.W. Klop, editors, Proc. of Concur 90, volume 458 of Lecture Notes in Computer Science, pages 99–114, Amsterdam, 1990. Springer-Verlag. Full version available as Technical Report CSN 90/17, Technische Universiteit Eindhoven.
F.S. de Boer and C. Palamidessi. A Fully Abstract Model for Concurrent Constraint Programming. In S. Abramsky and T.S.E. Maibaum, editors, Proc. of TAPSOFT/CAAP, volume 493 of Lecture Notes in Computer Science, pages 296–319. Springer-Verlag, 1991.
F.S. de Boer and C. Palamidessi. On the semantics of Concurrent Constraint Programming. Technical Report, Dipartimento di Informatica, Università di Pisa, 1992.
R. Gerth, M. Codish, Y. Lichtenstein, and E. Shapiro. Fully abstract denotational semantics for Concurrent Prolog. In Proc. of the Third IEEE Symposium on Logic In Computer Science, pages 320–335. IEEE Computer Society Press, New York, 1988.
M. Gabbrielli and G. Levi. Unfolding and fixpoint semantics for concurrent constraint logic programs. In H. Kirchner and W. Wechler, editors, Proc. of the Second Int. Conf. on Algebraic and Logic Programming, Lecture Notes in Computer Science, pages 204–216, Nancy, France, 1990. Springer-Verlag.
H. Gaifman, M. J. Maher, and E. Shapiro. Reactive Behaviour semantics for Concurrent Constraint Logic Programs. In E. Lusk and R. Overbeck, editors, North American Conference on Logic Programming, 1989.
L. Henkin, J.D. Monk, and A. Tarski. Cylindric Algebras (Part I). North-Holland, 1971.
J. Jaffar and J.-L. Lassez. Constraint logic programming. In Proc,. of ACM Symposium on Principles of Programming Languages, pages 111–119. ACM, New York, 1987.
J.N. Kok. A compositional semantics for Concurrent Prolog. In R. Cori and M. Wirsing, editors, Proc. Fifth Symposium on Theoretical Aspects of Computer Science, volume 294 of Lecture Notes in Computer Science, pages 373–388. Springer-Verlag, 1988.
M. J. Malier. Logic semantics for a class of committed-choice programs. In Jean-Louis Lassez, editor, Proc. of the Fourth International Conference on Logic Programming, Series in Logic Programming, pages 858–876, Melbourne, 1987. The MIT Press.
R. Milner. A Calculus of Communicating Systems, volume 92 of Lecture Notes in Computer Science. Springer-Verlag, New York, 1980.
D.M.R. Park. Concurrency and automata on infinite sequences. In P. Deussen, editor, Proc. of the 5th GI conference, Lecture Notes in Computer Science, pages 167–183. Springer-Verlag, 1981.
G.A. Ringwood. Pattern-Directed, Markovian, Linear Guarded Definite Clause Resolution. Technical report, Imperial College, London, 1987.
V.A. Saraswat. Partial Correctness Semantics for CP(0, , &). In Proc. of the Conference on Foundations of Software Computing and Theoretical Computer Science, volume 206 of Lecture Notes in Computer Science, pages 347–368. Springer-Verlag, 1985.
V.A. Saraswat. Concurrent Constraint Programming Languages. PhD thesis, Carnegie-Mellon University, January 1989. Published by The MIT Press, U.S.A., 1990.
D. Scott. Domains for denotational semantics. In Proc. of ICALP, 1982.
E.Y. Shapiro. A subset of Concurrent Prolog and its interpreter. Technical Report TR-003, Institute for New Generation Computer Technology (ICOT), Tokyo, 1983.
E. Y. Shapiro. Concurrent Prolog: A progress report. Computer, 19(8):44–58, 1986.
V.A. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of the seventeenth ACM Symposium on Principles of Programming Languages, pages 232–245. ACM, New York, 1990.
V.A. Saraswat, M. Rinard, and P. Panangaden. Semantics foundations of Concurrent Constraint Programming. In Proc. of the eighteenth ACM Symposium on Principles of Programming Languages. ACM, New York, 1991.
K. Ueda. Guarded Horn Clauses. In E. Y. Shapiro, editor, Concurrent Prolog: Collected Papers. The MIT Press, 1987.
K. Ueda. Guarded Horn Clauses, a parallel logic programming language with the concept of a guard. In M. Nivat and K. Fuchi, editors, Programming of Future Generation Computers, pages 441–456. North Holland, Amsterdam, 1988.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 British Computer Society
About this paper
Cite this paper
de Boer, F.S., Palamidessi, C. (1993). On the Semantics of Concurrent Constraint Programming. In: Broda, K. (eds) ALPUK92. Workshops in Computing. Springer, London. https://doi.org/10.1007/978-1-4471-3421-3_9
Download citation
DOI: https://doi.org/10.1007/978-1-4471-3421-3_9
Publisher Name: Springer, London
Print ISBN: 978-3-540-19783-6
Online ISBN: 978-1-4471-3421-3
eBook Packages: Springer Book Archive