Jump to content

Process graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Dmb000006 (talk | contribs) at 18:38, 26 May 2010 (I wonder if there is an article called p-graph...). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Template:New unreviewed article

New article name is

A Process-graph is a directed bigraph used in workflow modelling.

The vertices are of two types, operation and material. The two vertex types form two disjunctive sets. The edges of the graph link the material and operation units. An edge from an operation vertex (O) connects to a material vertex (M) if M is the output of O, such as a 'document' (material) that is output by a 'write-up' (operation). An edge from M to O indicates that M is element of the input set of O, e.g. a document may be input to a 'review' operation.

References