SODA

Time, clocks and committed choice parallelism for logic programming of real time computations

Elshiewy, Nabiel A. (1986) Time, clocks and committed choice parallelism for logic programming of real time computations. [SICS Report]

[img]
Preview
PDF
2949Kb

Abstract

A model for logic programming of real time computing systems is presented. The model is based on the process interpretation of Horn-Clause Logic and employs a non-deterministic committed-choice stream-And parallel search strategy. A real time computing system is represented as a network of communicating goals where each goal maintains its own logical clock which can be read and set by the node reduction process. The system of distributed logical clocks satisfies Lamport's correctness and distributed synchronisation conditions. The programming language is a variant of GHC to which many features are borrowed from PARLOG. Primitives to express time and timing constraints are provided. A meta-interpreter is given to describe the operational semantics of the language and the implementability of the model in the language itself. A telecommunications switching system has been specified and implemented in terms of the model presented here. It is also shown that the fairness problem has a natural solution in the proposed logical frame work. This is illustrated through a real time fair binary merge operator.

Item Type:SICS Report
Additional Information:Original report number R86013. Related paper "Logic Programming for Real Time Control of Telecommunication Switching Systems" appears in the Journal of Logic Programming, 1990.
ID Code:2559
Deposited By:Vicki Carleson
Deposited On:15 Sep 2009
Last Modified:18 Nov 2009 16:11

Repository Staff Only: item control page