Compositional refinements in multiple blackboard systems
type: Item
instance of: scholarly article
title: Compositional refinements in multiple blackboard systems
zbMATH Open document ID: 0829.68030
DOI: 10.1007/BF01213078
author: Yanyan Li
published in: Acta Informatica
publication date: 1995-10-04T00:00:00Z
review text: We introduce CONESP, a concurrent system built according to the SMoLCS methodology to provide an abstract model of the coordination language Extended Shared Prolog (ESP), which is based on the integration of the blackboard paradigm with Logic Programming. CONESP is hierarchy of blackboard systems, each consisting of a passive blackboard tree and a collection of active components including parallel agents and dynamic (sub)systems. An implementation relationship between two hierarchies is defined, which is shown to be compositional. Some techniques have also been developed for the direct proof, i.e. the basic step in the inductive proof that one system implements another. ESP is being used in the Oikos environment for software process modelling. The results of this paper are the basis for the formal verification of the correctness of the software process models built by stepwise-refinements in Oikos.
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 802441
zbMATH Keywords: extended shared prolog
zbMATH Keywords: logic programming
zbMATH Keywords: CONESP
MaRDI profile type: Publication
cites work: Direct semantics of concurrent languages in the SMoLCS approach
cites work: Q3777424
cites work: Q3992568
cites work: Extensional equivalences for transition systems
full work available at URL: https://doi.org/10.1007/bf01213078
OpenAlex ID: W2090127238
description: scientific article; zbMATH DE number 802441