NONDETERMINISTIC DATA FLOW PROGRAMS - HOW TO AVOID THE MERGE ANOMALY

被引：19

作者：

BROY, M ^{[1
]}

机构：

[1] UNIV PASSAU,FAK MATH & INFORMAT,D-8390 PASSAU,FED REP GER

来源：

SCIENCE OF COMPUTER PROGRAMMING | 1988年 / 10卷 / 01期

关键词：

COMPUTER PROGRAMMING - COMPUTER SYSTEMS PROGRAMMING - Multiprogramming;

D O I：

10.1016/0167-6423(88)90016-0

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

A simple programming language for the description of networks of loosely coupled, communicating, nondeterministic agents is introduced. Two possible graphical interpretations are discussed: finite cyclic and infinite acyclic, tree-like graphs. Operational semantics for such graphs is defined by computation sequences. The merge anomaly is described, analyzed and explained. Two fixed-point semantics are defined in a denotational style, one that avoids the merge anomaly, and another one that includes the merge anomaly, and they are proved to be consistent with the resp. operational definitions. Both definitions are compared and analyzed.

引用

页码：65 / 85

页数：21

共 15 条

[1]

BACK RJ, 1982, P ACM S PRINCIPLES D, P111

[2]

BEKIC H, 1982, UNPUB NONDETERMINIST

[3]

BOUSSINOT F, 1981, THESIS U PARIS 7

[4]

BROCK JD, 1981, LECT NOTES COMPUT SC, V107, P252

[5]

Broy M., 1982, Theoretical Foundations of Programming Methodology. Lecture Notes of an International Summer School, P565

[6]

BROY M, 1982, FORMAL DESCRIPTION P, V2

[7]

KELLER RM, 1978, FORMAL DESCRIPTION P, P337

[8]

KOSINSKI PR, 1979, MIT TR220 LAB COMP S

[9]

NEUHOLD EJ, 1978, FORMAL DESCRIPTION P

[10]

Nivat M., 1975, S MAT, V15, P255

← 1 2 →