On the Semantics of Concurrent Constraint Programming
1993; Springer Nature; Linguagem: Inglês
10.1007/978-1-4471-3421-3_9
ISSN1431-1682
AutoresFrank S. de Boer, Catuscia Palamidessi,
Tópico(s)Model-Driven Software Engineering Techniques
ResumoOne 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).
Referência(s)