Old Dominion Univ., Norfolk, VA, Report No. NAS 1.26:4167, 1988.
Abstract: The development of a new graph theoretic model for describing the relation between a decomposed algorithm and its execution in a data flow environment is presented. Called ATAMM, the model consists of a set of Petri net marked graphs useful for representing decision-free algorithms having large-grained, computationally complex primitive operations.