Specification of concurrent processes using a dataflow model of computation and partially ordered events

Abstract In this article, we present a model and a proof system for concurrent processes. The model is based on dataflow principles. A dataflow graph, which represents a process, is defined in terms of input and output links (representing the ports for external communication), and actors (representing computations). The flow of data on links allows us to define markings which in turn provide an abstraction for the state of the process, and the sequence of markings define the execution history of a process. Events that define transitions of markings are partially ordered. A formal algebra along with a first-order proof system for graph compositions using these markings is outlined. We chose the dataflow graph model of computation because it facilitates the representation of concurrency at all levels of abstraction.