...Definitions and theorems can be found in appropriate textbooks, eg [Char 93]. A directed graph G = (V, E) consists of a set of nodes V and a set of directed edges EC V2. For an edge (vi,v2) we write vi -> w2, to make the edge direction clear. Often, we are interested...

...knowledge about the jobs and its execution environment. Gfc is a directed acyclic graph consisting of a set of nodes V and a set of directed edges E with a fixed structure. Every node is considered as a random variable and can assume Boolean values....