Process graph: Difference between revisions

Revision as of 14:40, 31 January 2016

Revision as of 20:34, 31 January 2016

Line 6:

In [[graph theory]] a '''process-graph''' is a [[directed graph|directed]] [[bipartite graph]] used in [[workflow]] [[Conceptual model|modeling]].

The [[vertex (graph theory)|vertices]] of the [[Graph (discrete mathematics)|graph]]{{dn|date=January 2016}} are of two types, operation (O) and material (M). The two vertex types form two [[:wikt:disjunctive|disjunctive]] [[set (mathematics)|set]]s. The [[edge (geometry)|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.

==Applications==