125 results about "Dependency relation" patented technology

In mathematics and computer science, a dependency relation is a binary relation that is finite, symmetric, and reflexive; i.e. a finite tolerance relation. That is, it is a finite set of ordered pairs D, such that If (a,b)∈D then (b,a)∈D (symmetric) If a is an element of the set on which the relation is defined, then (a,a)∈D (reflexive) In general, dependency relations are not transitive; thus, they generalize the notion of an equivalence relation by discarding transitivity.