Jump to content

Process graph

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by BD2412 (talk | contribs) at 02:07, 14 September 2010 (Fixing links to disambiguation pages, improving links, other minor cleanup tasks using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Template:New unreviewed article

In graph theory a process-graph is a directed bigraph used in workflow [[Conceptual model modelling]].

The vertices of the graph are of two types, operation (O) and material (M). The two vertex types form two disjunctive sets. The edges of the graph link the O and M vertices. 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 an element of the input set of O, e.g. a document may be part of the input to a 'review' operation.

References