Dependency relation
Summary
In computer science, in particular in concurrency theory, a dependency relation is a symmetric and reflexive binary relation on a finite domain ; i.e. a finite tolerance relation. That is, it is a finite set of ordered pairs , such that
Further reading
- Wikipedia, page 10739341, revision 1330111201, Dependency relation. adopted
About this page
| Tag | WCJBEBVFB8 |
|---|---|
| URI | m2://WCJBEBVFB8 |
| Aliases | concurrent-alphabet, independency-relation, reliance-alphabet |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.