Dependency relation

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 {displaystyle D} , such that 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 {displaystyle D} , such that In general, dependency relations are not transitive; thus, they generalize the notion of an equivalence relation by discarding transitivity. Let Σ {displaystyle Sigma } denote the alphabet of all the letters of D {displaystyle D} . Then the independency induced by D {displaystyle D} is the binary relation I {displaystyle I} That is, the independency is the set of all ordered pairs that are not in D {displaystyle D} . The independency is symmetric and irreflexive. The pairs ( Σ , D ) {displaystyle (Sigma ,D)} and ( Σ , I ) {displaystyle (Sigma ,I)} , or the triple ( Σ , D , I ) {displaystyle (Sigma ,D,I)} (with I {displaystyle I} induced by D {displaystyle D} ) are sometimes called the concurrent alphabet or the reliance alphabet. The pairs of letters in an independency relation induce an equivalence relation on the free monoid of all possible strings of finite length. The elements of the equivalence classes induced by the independency are called traces, and are studied in trace theory. Consider the alphabet Σ = { a , b , c } {displaystyle Sigma ={a,b,c}} . A possible dependency relation is