Dependency relation
id:
dependency-relation-322-18416023
title:
Dependency relation
text:
In computer science, in particular in concurrency theory, a dependency relation is a binary relation on a finite domain Σ , symmetric, and reflexive; i.e. a finite tolerance relation. That is, it is a finite set of ordered pairs D , such that If ∈ D then ∈ D (symmetric)
If a ∈ Σ , then ∈ D (reflexive) In general, dependency relations are not transitive; thus, they generalize the notion of an equivalence relation by discarding transitivity. Σ is also called the alphabet on which D is defined. The
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Dependency_relation
date created:
date modified:
2024-01-24T16:38:12Z
main entity:
{"identifier":"Q1169754","url":"https://www.wikidata.org/entity/Q1169754"}
image:
fields total:
13
integrity:
13