Relevance of network theory to models of distributed/parallel processing

This paper is concerned with the applicability of network theory to those aspects of distributed/parallel processing that can be modeled by marked graphs. First, several examples are given to illustrate that a wide variety of computation schemes can be modeled by marked graphs. Subsequently, the following topics are discussed: application of KVL to fault detection and isolation, KCL and Tellegen's Theorem applied to marked graphs, and the relationship between the maximum (minimum) storage requirement and the minimum (maximum) power.