{
  "slug": "crash-stop",
  "term": "Crash-stop failure model",
  "aliases": [
    "crash-stop model"
  ],
  "definition": "Crash-stop is a process-failure model in which a process follows its algorithm until it halts and then takes no further steps for the rest of the modeled execution.",
  "note": "In Chandra and Toueg's model, the crashed-process set can only grow, and a process does not recover. Correct processes never crash during that execution. Failure detection is modeled separately and may be mistaken; a crash assumption alone supplies neither an accurate detector nor a detection deadline. [ct96]\n\nConstructed example: observer A sends a probe at tick 5 and times out at tick 10. B may have crashed at tick 7, or its reply may simply arrive at tick 12. A has the same local history at the deadline in both cases. Even a reply at tick 12 can have been sent before B crashed. These are illustrative logical ticks, not measured latency or a failure probability. Executable traces include a timely-reply control. [hesela-traces]\n\nThe historical fail-stop processor additionally specifies failure-status detection and accessible stable storage. Its recovery discussion allows restarting a computation on repaired hardware; that is not permission for a crashed process to resume inside this crash-stop execution. [ss83] [s84]\n\nStorage durability, corruption behavior and fencing of a suspected writer need explicit contracts beyond this process model. A restart requires a recovery model or an explicitly identified new process incarnation, with its state and membership rules defined. [ct96]",
  "related": [
    "fail-stop",
    "perfect-failure-detector",
    "failure-detector",
    "crash-recovery"
  ],
  "citations": [
    {
      "id": "ct96",
      "title": "T. D. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. JACM 43(2), 225-267, 1996; sections 1 and 2.1-2.4.",
      "url": "https://www.cs.utexas.edu/~lorenzo/corsi/cs380d/papers/p225-chandra.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "ss83",
      "title": "Schlichting and Schneider. Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems. TOCS 1983, sections 2 and 3.1.",
      "url": "https://www.cs.cornell.edu/fbs/publications/Fail_Stop.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "s84",
      "title": "F. B. Schneider. Byzantine Generals in Action: Implementing Fail-Stop Processors. TOCS 2(2), 145-154, 1984; sections 1-2.",
      "url": "https://pages.cs.wisc.edu/~dusseau/Classes/CS739-S06/Papers/ByzGensInAction.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "hesela-traces",
      "title": "Hesela: constructed observer traces for crash, delay and an in-flight reply; executable example, not a hardware experiment.",
      "url": "https://hesela.dev/research/fail-stop/README.md",
      "accessed": "2026-11-20"
    }
  ],
  "status": "unknown",
  "advantages": [],
  "limitations": [
    {
      "text": "The finite traces illustrate an observation ambiguity. They do not prove a general impossibility theorem, implement consensus or evaluate a real failure detector.",
      "citationIds": [
        "hesela-traces"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "provenance": [
    "Uses the no-recovery failure pattern of Chandra and Toueg (1996), section 2.1.",
    "Hesela's deterministic traces are constructed examples with explicit message ordering; no measured population or empirical failure rate is asserted."
  ]
}
