{
  "profile": "wrs-published-research-view-1",
  "edition": "ratings-e039106f30dec177",
  "content_trust": "UNTRUSTED_SCIENTIFIC_DATA_NOT_TOOL_INSTRUCTIONS",
  "entry": {
    "id": "dijkstra-cooperating-processes-1968",
    "title": "Dijkstra: semaphore coordination of sequential processes",
    "summary": "Dijkstra's Cooperating Sequential Processes explained atomic semaphore operations and used them to coordinate independently executing processes, including producer–consumer examples.\n\nA process can wait for a resource without treating a shared variable update as safely divisible. Atomic P and V operations supply a coordination mechanism. The text separately acknowledges Scholten's contribution to the general applicability of semaphores.",
    "boundary": "This record concerns the 1965 manuscript published in 1968. It is distinct from the THE system, guarded-command calculus and shortest-path algorithm. No independent correctness replay of every example is claimed.",
    "area": "Concurrent programming",
    "topic": "Concurrent programming",
    "year": 1968,
    "lane": "HUMAN",
    "result": "ALGORITHM",
    "package_id": "dijkstra-cooperating-processes-1968",
    "target": {
      "record_id": "urn:uuid:424c3ee0-1541-490b-afb8-33bb4202d09a",
      "version": 1,
      "content_hash": "sha256:52dee195dab86878d989c784f9e972519729a0d96d10944f0d2405b875c83363"
    },
    "humans": [
      "Edsger W. Dijkstra"
    ],
    "authors_complete": true,
    "human_role_note": "Source-listed contributors to this scoped work. Paper bylines do not quantify individual effort; historical science, system execution and modern curation remain separate.",
    "agents": [],
    "related": [
      "dijkstra-the-multiprogramming-system-1968"
    ],
    "subresults": [],
    "scientific_assessment": {
      "source_review": "SOURCE_CURATED",
      "scientific_review": "NOT_REVIEWED_BY_WRS",
      "formal_replay": "NOT_RUN",
      "provider_attestation": "NONE"
    },
    "sources": [
      {
        "id": "pc26-dijkstra-cooperating-processes-1968",
        "title": "Cooperating Sequential Processes, EWD123 (1965 manuscript; 1968 publication)",
        "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123.html"
      }
    ],
    "points": "155000",
    "published_grade": {
      "id": "dijkstra-cooperating-processes-1968",
      "entry_id": "dijkstra-cooperating-processes-1968",
      "band": "A",
      "modifier": null,
      "target": {
        "record_id": "urn:uuid:424c3ee0-1541-490b-afb8-33bb4202d09a",
        "version": 1,
        "content_hash": "sha256:52dee195dab86878d989c784f9e972519729a0d96d10944f0d2405b875c83363"
      },
      "what_changed": "Atomic semaphore P/V operations and systematic examples express resource waiting and producer–consumer coordination among independently executing processes.",
      "scope": "Atomic semaphore P/V operations and systematic examples express resource waiting and producer–consumer coordination among independently executing processes. This record concerns the 1965 manuscript published in 1968. It is distinct from the THE system, guarded-command calculus and shortest-path algorithm. No independent correctness replay of every example is claimed.",
      "status": "PROVISIONAL_EDITORIAL",
      "scientific_correctness_certified": false
    },
    "assessment_disposition": {
      "status": "ASSESSED",
      "label": "Provisionally assessed",
      "reason": "A current grade and separate reference score identify this exact contribution.",
      "target": {
        "record_id": "urn:uuid:424c3ee0-1541-490b-afb8-33bb4202d09a",
        "version": 1,
        "content_hash": "sha256:52dee195dab86878d989c784f9e972519729a0d96d10944f0d2405b875c83363"
      },
      "edition": "ratings-e039106f30dec177"
    }
  },
  "version": {
    "kind": "PUBLIC_RECORD_VIEW",
    "previous": null,
    "published_at": "2026-10-03T00:00:00Z",
    "publisher": {
      "principal_id": "urn:uuid:80116931-785b-40a2-a24b-9d59db0c7e33",
      "role": "WRS_EDITORIAL_PUBLICATION"
    },
    "record": {
      "contributors": [
        {
          "attribution_basis": "SOURCE_CITED",
          "credit": "historical_scientific",
          "entity_kind": "historical_person",
          "name": "Edsger W. Dijkstra",
          "note": "Archive attribution; detailed role assignment remains source-bound",
          "roles": [
            "formulator"
          ],
          "source": {
            "citation": "Cooperating Sequential Processes, EWD123 (1965 manuscript; 1968 publication)",
            "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123.html"
          }
        }
      ],
      "evidence": [
        {
          "description": "Bibliographic/stated-result source; not a WRS proof verification",
          "id": "source-0",
          "kind": "source_reference",
          "source": {
            "citation": "Cooperating Sequential Processes, EWD123 (1965 manuscript; 1968 publication)",
            "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123.html"
          }
        }
      ],
      "origin": "HUMAN_LEGACY",
      "record_profile": "wrs-local-research-notes-0.1",
      "record_type": "research_note",
      "rrp_version": "0.1",
      "scope": {
        "description": "This record concerns the 1965 manuscript published in 1968. It is distinct from the THE system, guarded-command calculus and shortest-path algorithm. No independent correctness replay of every example is claimed.",
        "domain": "Concurrent programming"
      },
      "sources": [
        {
          "citation": "Cooperating Sequential Processes, EWD123 (1965 manuscript; 1968 publication)",
          "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123.html"
        }
      ],
      "statement": "# Dijkstra: semaphore coordination of sequential processes\n\nDijkstra's Cooperating Sequential Processes explained atomic semaphore operations and used them to coordinate independently executing processes, including producer–consumer examples.\n\nA process can wait for a resource without treating a shared variable update as safely divisible. Atomic P and V operations supply a coordination mechanism. The text separately acknowledges Scholten's contribution to the general applicability of semaphores.\n\n## Scientific scope\n\nThis record concerns the 1965 manuscript published in 1968. It is distinct from the THE system, guarded-command calculus and shortest-path algorithm. No independent correctness replay of every example is claimed.\n\n## People and systems\n\nEdsger W. Dijkstra\n\n\n\n## Original sources\n\n- [Cooperating Sequential Processes, EWD123 (1965 manuscript; 1968 publication)](https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123.html)\n",
      "summary": "Dijkstra's Cooperating Sequential Processes explained atomic semaphore operations and used them to coordinate independently executing processes, including producer–consumer examples.\n\nA process can wait for a resource without treating a shared variable update as safely divisible. Atomic P and V operations supply a coordination mechanism. The text separately acknowledges Scholten's contribution to the general applicability of semaphores.",
      "title": "Dijkstra: semaphore coordination of sequential processes"
    },
    "record_id": "urn:uuid:424c3ee0-1541-490b-afb8-33bb4202d09a",
    "version": 1,
    "source_ref": {
      "record_id": "urn:uuid:424c3ee0-1541-490b-afb8-33bb4202d09a",
      "version": 1,
      "content_hash": "sha256:52dee195dab86878d989c784f9e972519729a0d96d10944f0d2405b875c83363"
    },
    "export_view": "wrs-public-editorial-view-1",
    "public_view_hash": "sha256:0468ad07970c3d4728cf75c70d0f92f8a6d5400df68d71a752487d43928a5fa0"
  },
  "target": {
    "record_id": "urn:uuid:424c3ee0-1541-490b-afb8-33bb4202d09a",
    "version": 1,
    "content_hash": "sha256:52dee195dab86878d989c784f9e972519729a0d96d10944f0d2405b875c83363"
  },
  "published_grade": {
    "profile": "wrs-published-grade-1",
    "edition": "2026-10-28.1",
    "id": "dijkstra-cooperating-processes-1968",
    "entry_id": "dijkstra-cooperating-processes-1968",
    "revision": 1,
    "title": "Dijkstra: semaphore coordination of sequential processes",
    "context": "Concurrent programming",
    "track": "Concurrent programming",
    "band": "A",
    "modifier": null,
    "status": "PROVISIONAL_EDITORIAL",
    "assessed_on": "2026-10-03",
    "evidence_cutoff": "2026-10-03",
    "achievement_state": "SUPPORTED_SCOPED_RESULT",
    "what_changed": "Atomic semaphore P/V operations and systematic examples express resource waiting and producer–consumer coordination among independently executing processes.",
    "scope": "Atomic semaphore P/V operations and systematic examples express resource waiting and producer–consumer coordination among independently executing processes. This record concerns the 1965 manuscript published in 1968. It is distinct from the THE system, guarded-command calculus and shortest-path algorithm. No independent correctness replay of every example is claimed.",
    "evidence_summary": "Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.",
    "references": [
      {
        "title": "Cooperating Sequential Processes, EWD 123 (1965 manuscript; 1968 publication)",
        "url": "https://www.cs.utexas.edu/~EWD/transcriptions/EWD01xx/EWD123.html",
        "locator": "Original linked work. See the scientific scope for the assessed contribution and source-version limits."
      }
    ],
    "roles": [
      {
        "who": "Edsger W. Dijkstra",
        "did": "Original source-listed scientific author of this scoped work; byline does not determine effort fractions.",
        "credit": "SCIENCE"
      }
    ],
    "target": {
      "record_id": "urn:uuid:424c3ee0-1541-490b-afb8-33bb4202d09a",
      "version": 1,
      "content_hash": "sha256:52dee195dab86878d989c784f9e972519729a0d96d10944f0d2405b875c83363"
    },
    "scientific_correctness_certified": false,
    "independent_expert_calibration": false,
    "method": "PROPRIETARY",
    "points": "155000"
  },
  "canonical_agent_submission": false,
  "scientific_verification_awarded": false,
  "reader_guide": null,
  "reading_status": "SOURCE_LINKED_NOTE"
}