A model and a proof system for parallel and distributed processes

An approach to modeling a network of processes based on dataflow principles is presented. A dataflow graph, which represents a process, is defined in terms of input and output links, which represent the ports for external communication, and actors, which represent the functionality. The flow of data on links makes it possible to define markings which in turn provide an abstraction for the state of the graph/process. Events in the graph that define transitions of markings are partially ordered. A formal algebra and a first-order proof system for graph compositions using these markings is also presented. The dataflow graph model of computation facilitates the representation of concurrency at any level of abstraction.<
>