Partial order and contextual net semantics for atomic and locally atomic CC programs

Bueno Carrillo, Francisco; Hermenegildo, Manuel V. y Rossi, Francesca (1998). Partial order and contextual net semantics for atomic and locally atomic CC programs. "Science of Computer Programming", v. 30 (n. 1-2); pp. 51-82. ISSN 0167-6423. https://doi.org/10.1016/S0167-6423(97)00007-5.

Descripción

Título: Partial order and contextual net semantics for atomic and locally atomic CC programs
Autor/es:
  • Bueno Carrillo, Francisco
  • Hermenegildo, Manuel V.
  • Rossi, Francesca
Tipo de Documento: Artículo
Título de Revista/Publicación: Science of Computer Programming
Fecha: Enero 1998
Volumen: 30
Materias:
Palabras Clave Informales: Concurrency, Constraints, Semantics, Concurrencia, Semántica
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (2MB) | Vista Previa

Resumen

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 extensión 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 semantics is also suitable for CC programs with a new kind of atomic tell (called locally atomic tell), which checks for consistency only the constraints it depends on. Such a tell achieves a reasonable trade-off between efficiency and atomicity, since the checked constraints can be stored in a local memory and are thus easily accessible even in a distributed implementation.

Más información

ID de Registro: 14267
Identificador DC: http://oa.upm.es/14267/
Identificador OAI: oai:oa.upm.es:14267
Identificador DOI: 10.1016/S0167-6423(97)00007-5
URL Oficial: http://www.sciencedirect.com/science/article/pii/S0167642397000075
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 15 Ene 2013 10:10
Ultima Modificación: 21 Abr 2016 13:50
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM