This paper proposes the use of information graphs to analyse the network of interrelated processes that take place in any organisation. The concepts and the results of the previous work of the authors on information graphs have been used. This paper proposes a description of the structure of an elementary process and shows the relationship that exists between it and the information graph in the form of a mapping that is a bijection. The basic algebraic properties of this relation have been proved by means of a binary operation, the concatenation of information graphs. In the future, the performance of any organisation can be analysed using the relationship between information graphs and process networks.