Dependency relation
In computer science, in particular in concurrency theory, a dependency relation is a symmetric and reflexive binary relation on a finite domain Σ {\displaystyle \Sigma } ; i.e. a finite tolerance relation.
In computer science, in particular in concurrency theory, a dependency relation is a symmetric and reflexive binary relation on a finite domain Σ {\displaystyle \Sigma } ; i.e. a finite tolerance relation.
In computer science, in particular in concurrency theory, a dependency relation is a symmetric and reflexive binary relation on a finite domain Σ {\displaystyle \Sigma } ; i.e. a finite tolerance relation.
Source: Wikipedia "Dependency relation" · CC BY-SA 4.0
Share this article: X · Bluesky