A Network of Communicating Logic Programs as an Extension of Kahn's Model
Summary :
In this paper, a network of communicating logic programs is proposed as a model for concurrent programming based on logic programs with explicit channels of communications. On the assumption that the denotations of channels are defined by using a sequence domain, semantics for unbounded nondeterminism caused by logic programs is dealt with and the whole network is defined as an extension of Kahn's pure dataflow. A denotational semantics for the whole network is defined by a recursive relation set as to the histories of channels. The method to investigate extensionality of input-output histories on the node in nondeterministic dataflow is not applicable to the proposed network, because the node is a logic program. Fairness is required for unbounded nondeterminism to describe the behaviour of the whole network. And in this paper the corresponding semantics of the network is shown. We have a method of defining a continuous function which is associated with the network, based on histories of channels. The least fixpoint of the function is regarded as a denotational semantics for the whole network, to reflect its fair behaviours.
- Publication
- IEICE TRANSACTIONS on Information Vol.E74-D No.4 pp.965-974
- Publication Date
- 1991/04/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- PAPER
- Category
- Automaton, Language and Theory of Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Susumu YAMASAKI, "A Network of Communicating Logic Programs as an Extension of Kahn's Model" in IEICE TRANSACTIONS on Information,
vol. E74-D, no. 4, pp. 965-974, April 1991, doi: .
Abstract: In this paper, a network of communicating logic programs is proposed as a model for concurrent programming based on logic programs with explicit channels of communications. On the assumption that the denotations of channels are defined by using a sequence domain, semantics for unbounded nondeterminism caused by logic programs is dealt with and the whole network is defined as an extension of Kahn's pure dataflow. A denotational semantics for the whole network is defined by a recursive relation set as to the histories of channels. The method to investigate extensionality of input-output histories on the node in nondeterministic dataflow is not applicable to the proposed network, because the node is a logic program. Fairness is required for unbounded nondeterminism to describe the behaviour of the whole network. And in this paper the corresponding semantics of the network is shown. We have a method of defining a continuous function which is associated with the network, based on histories of channels. The least fixpoint of the function is regarded as a denotational semantics for the whole network, to reflect its fair behaviours.
URL: https://global.ieice.org/en_transactions/information/10.1587/e74-d_4_965/_p
Copy
@ARTICLE{e74-d_4_965,
author={Susumu YAMASAKI, },
journal={IEICE TRANSACTIONS on Information},
title={A Network of Communicating Logic Programs as an Extension of Kahn's Model},
year={1991},
volume={E74-D},
number={4},
pages={965-974},
abstract={In this paper, a network of communicating logic programs is proposed as a model for concurrent programming based on logic programs with explicit channels of communications. On the assumption that the denotations of channels are defined by using a sequence domain, semantics for unbounded nondeterminism caused by logic programs is dealt with and the whole network is defined as an extension of Kahn's pure dataflow. A denotational semantics for the whole network is defined by a recursive relation set as to the histories of channels. The method to investigate extensionality of input-output histories on the node in nondeterministic dataflow is not applicable to the proposed network, because the node is a logic program. Fairness is required for unbounded nondeterminism to describe the behaviour of the whole network. And in this paper the corresponding semantics of the network is shown. We have a method of defining a continuous function which is associated with the network, based on histories of channels. The least fixpoint of the function is regarded as a denotational semantics for the whole network, to reflect its fair behaviours.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - A Network of Communicating Logic Programs as an Extension of Kahn's Model
T2 - IEICE TRANSACTIONS on Information
SP - 965
EP - 974
AU - Susumu YAMASAKI
PY - 1991
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E74-D
IS - 4
JA - IEICE TRANSACTIONS on Information
Y1 - April 1991
AB - In this paper, a network of communicating logic programs is proposed as a model for concurrent programming based on logic programs with explicit channels of communications. On the assumption that the denotations of channels are defined by using a sequence domain, semantics for unbounded nondeterminism caused by logic programs is dealt with and the whole network is defined as an extension of Kahn's pure dataflow. A denotational semantics for the whole network is defined by a recursive relation set as to the histories of channels. The method to investigate extensionality of input-output histories on the node in nondeterministic dataflow is not applicable to the proposed network, because the node is a logic program. Fairness is required for unbounded nondeterminism to describe the behaviour of the whole network. And in this paper the corresponding semantics of the network is shown. We have a method of defining a continuous function which is associated with the network, based on histories of channels. The least fixpoint of the function is regarded as a denotational semantics for the whole network, to reflect its fair behaviours.
ER -
English
