Meta model of concurrent computation I. Graph model

This is the first piece of a series of papers on concurrent computation models. A graph model was proposed for the concurrent computation using ideas from the proof theory. A computational object was represented by a graph while the computation process was modeled by graph rewriting under a communication as cut elimination paradigm. Formal account of the model was given in the framework of graph calculus. The significance of the model lies in that it initiates a proof theoretical approach to concurrency theory.