{
  "aliases": [
    "concurrent-alphabet",
    "independency-relation",
    "reliance-alphabet"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn computer science, in particular in concurrency theory, a **dependency relation** is a [[symmetric|061J5VGSPT]] and [[reflexive|0X8NMST0J2]] [[binary relation|05AVARPXA2]] on a finite domain $\\Sigma$; i.e. a finite tolerance relation. That is, it is a finite set of [[ordered pairs|0JQWWFCS9R]] $D$, such that\n",
  "commit": "4a3290d299c8b2cd6493fce2296920ba7f82d942",
  "front": {
    "aliases": [
      "concurrent-alphabet",
      "independency-relation",
      "reliance-alphabet"
    ],
    "inventory": [
      "RYJNK5TE6W"
    ],
    "kind": "concept",
    "name": "Dependency relation",
    "same_as": {
      "wikidata": "Q1169754",
      "wikipedia": "Dependency relation"
    },
    "sources": [
      {
        "locator": "Dependency relation",
        "mention": "wikipedia://en/10739341",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:10739341@r1330111201"
      }
    ],
    "tag": "WCJBEBVFB8"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/WCJBEBVFB8/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/WCJBEBVFB8.md",
  "msc": null,
  "name": "Dependency relation",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/WCJ/WCJBEBVFB8.md",
  "status": null,
  "tag": "WCJBEBVFB8",
  "uri": "m2://WCJBEBVFB8",
  "url": "https://math2.tamnd.com/wiki/dependency-relation/",
  "writing": {
    "tag": "WCJBEBVFB8",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}