Nondeterministic data flow programs: How to avoid the merge anomaly
type: Item
instance of: scholarly article
title: Nondeterministic data flow programs: How to avoid the merge anomaly
zbMATH Open document ID: 0632.68016
DOI: 10.1016/0167-6423(88)90016-0
author: Manfred Broy
published in: Science of Computer Programming
publication date: 1988-01-01T00:00:00Z
review text: 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 respective operational definitions. Both definitions are compared and analyzed.
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68N01
zbMATH DE Number: 4028872
zbMATH Keywords: programming language for the description of networks
zbMATH Keywords: nondeterministic agents
zbMATH Keywords: tree-like graphs
zbMATH Keywords: Operational semantics
zbMATH Keywords: computation sequences
zbMATH Keywords: fixed-point semantics
MaRDI profile type: Publication
full work available at URL: 0167-6423(88)90016-0
OpenAlex ID: W2030755010
description: scientific article; zbMATH DE number 4028872