Nondeterministic data flow programs: How to avoid the merge anomaly (Q1095640)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Nondeterministic data flow programs: How to avoid the merge anomaly
scientific article

    Statements

    Nondeterministic data flow programs: How to avoid the merge anomaly (English)
    0 references
    0 references
    1988
    0 references
    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.
    0 references
    0 references
    programming language for the description of networks
    0 references
    nondeterministic agents
    0 references
    tree-like graphs
    0 references
    Operational semantics
    0 references
    computation sequences
    0 references
    fixed-point semantics
    0 references
    0 references