zbMATH — the first resource for mathematics

A paradigm for asynchronous communication and its application to concurrent constraint programming. (English) Zbl 0832.68014
Apt, K. R. (ed.) et al., Logic programming languages. Constraints, functions, and objects. London: MIT Press. 82-114 (1993).
Summary: We develop a general semantic theory of asynchronous communication in concurrent logic and concurrent constraint languages. The main characteristic of these languages, from the point of view of the communication mechanism, is that processes interact by querying and updating some common data structure. We abstract from the specific features of the underlying data structure by means of a uniform language of which the actions are interpreted as transformations on an abstract set of states. This approach shows that there exists a basic similarity between concurrent logic (constraint) languages and other languages based on asynchronous communication, like dataflow and asynchronous CSP. They can be obtained as instances of this uniform language, such an instance being determined by a specific set of states and interpretation of the actions.In this chapter, this is worked out in detail for concurrent constraint languages. (Some other examples are provided as well like a language with assignments and I/O automata). The computational model of our paradigm is described by a transition system in the style of Plotkin’s SOS. A compositional model is presented that is based on reactive sequences, i.e., sequences of pairs of states.
For the entire collection see [Zbl 0831.68011].

68N17 Logic programming