Una semántica ejecutable en lógica de reescritura para programación espacial concurrente por restricciones (SCCP)

This document presents an executable semantics in rewrite logic for Concurrent Spatial Constraint Programming, abbreviated SCCP. SCCP is a computational model used to reason about spatial information and knowledge distributed among the processes of a system. In SCCP, the processes simulate common knowledge statement and global information query, in turn, each agent in SCCP has its own information space, and epistemic entities such as knowledge or beliefs are represented in a system of parametric constraints. The executable semantics of SCCP is made available to users and programmers through a tool that integrates a programming language and specification into Maude. From this tool, in addition to simulating programs in this language, it is also possible to verify properties specified in temporal linear logic.

• Autores: Romero González, Miguel Ángel
• Tipo de recurso: Trabajo de grado de pregrado
• Fecha de publicación: 2017
• Institución: Escuela Colombiana de Ingeniería Julio Garavito
• Repositorio: Repositorio Institucional ECI
• Idioma: spa
• OAI Identifier: oai:repositorio.escuelaing.edu.co:001/522
• Acceso en línea: http://catalogo-intra.escuelaing.edu.co/cgi-bin/koha/catalogue/detail.pl?biblionumber=19894; https://repositorio.escuelaing.edu.co/handle/001/522
• Palabra clave: SCCP; Lógica de reescritura; Especificación formal; Maude; SMT-Solver; Tkinter; Python; Parser; SCCP; rewriting logic; formal specification; Maude; SMT-Solver; Tkinter; Parser; Python
• Rights: openAccess
• License: Derechos Reservados - Escuela Colombiana de Ingeniería Julio Garavito