ALP 1996: Algebraic and Logic Programming pp 165-178 | Cite as
A process algebra for synchronous concurrent constraint programming
Integration of Paradigms
First Online:
Abstract
Concurrent constraint programming is classically based on asynchronous communication via a shared store. This paper presents new version of the ask and tell primitives which features synchronicity. Our approach is based on the idea of telling new information just in the case that a concurrently running process is asking for it.
An operational and an algebraic semantics are defined. The algebraic semantics is proved to be sound and complete with respect to a compositional operational semantics which is also presented in the paper.
Keywords
Operational Semantic Parallel Composition Process Algebra Asynchronous Communication Algebraic Semantic
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.
Preview
Unable to display preview. Download preview PDF.
References
- [1]Krzysztof Apt, editor. Proceedings of the Joint International Conference and Symposium on Logic Programming, Washington, USA, 1992. The MIT Press.Google Scholar
- [2]J.C.M. Baeten and W.P Weijland. Process Algebra. Cambridge University Press, 1990.Google Scholar
- [3]L. Brim, J-M. Jacquet, D. Gilbert, and M. Křetínský. New Versions of Ask and Tell for Synchronous Communication in Concurrent Constraint Programming. Technical Report No. 1996/03. ISSN 1364-4009, Northampton Square, London EC1V 0HB, 1996.Google Scholar
- [4]L. Brim, J-M. Jacquet, D. Gilbert, and M. Křetínský. A Process Algebra for Synchronous Concurrent Constraint Programming. Technical Report No. 1996/06. ISSN 1364-4009, Northampton Square, London EC1V 0HB, 1996.Google Scholar
- [5]F. S de Boer, J. W. Klop, and C. Palamidessi. Asynchronous communication in process algebra. In Proceedings, 7th Annual IEEE Symp. on Logic in Computer Science, pages 137–147. IEEE Computer Society Press, 1992.Google Scholar
- [6]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/CAAP91, Lecture Notes in Computer Science, pages 296–319. Springer-Verlag, 1991.Google Scholar
- [7]F. S. de Boer and C. Palamidessi. A process algebra of concurrent constraint programming. In {om AptGoogle Scholar
- [8]M. Falaschi, G. Levi, and C. Palamidessi. A Synchronization Logic: Axiomatics and Formal Semantics of Generalized Horn Clauses. Information and Control, 60:36–69, 1994.Google Scholar
- [9]J.-M. Jacquet and L. Monteiro. Communicating clauses: Towards synchronous communication in contextual logic programming. In Apt [1], pages 98–112.Google Scholar
- [10]R. Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
- [11]G. Plotkin. A structured approach to operational semantics. Technical report, DAIMI FN-19, Computer Science Department, Aarhus University, 1981.Google Scholar
- [12]V. Saraswat. Concurrent Constraint Programming. MIT Press, 1993.Google Scholar
- [13]V. Saraswat and M. Rinard. Concurrent constraint programming. In Proc. of 17th POPL, pages 232–245, 1990.Google Scholar
- [14]V. Saraswat, M. Rinard, and P. Panangaden. Semantic foundations of concurrent constrant programming. In Proc. of 18th POPL. ACM, 1991.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 1996