Published in

Elsevier, Science of Computer Programming, 1-2(30), p. 51-82, 1998

DOI: 10.1016/s0167-6423(97)00007-5

Links

Tools

Export citation

Search in Google Scholar

Partial Order and Contextual Net Semantics for Atomic and Locally Atomic CC Programs.

Journal article published in 1998 by Francisco Bueno, Manuel V. Hermenegildo ORCID, Ugo Montanari, Francesca Rossi
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

We present two concurrent semantics (i.e. semantics where concurrency is explicitely represented) for CC programs with atomic tells. One is based on simple partial orders of computation steps, while the other one is based on contextual nets and it is an extension of a previous one for eventual CC programs. Both such semantics allow us to derive concurrency, dependency, and nondeterminism information for the considered languages. We prove some properties about the relation between the two semantics, and also about the relation between them and the operational semantics. Moreover, we discuss how to use the contextual net semantics in the context of CLP programs. More precisely, by interpreting concurrency as possible parallelism, our semantics can be useful for a safe parallelization of some CLP computation steps. Dually, the dependency information may also be interpreted as necessary sequentialization, thus possibly exploiting it for the task of scheduling CC programs. Moreover, our s...