Patent US1448652A successfully refreshed from Google Patents.
Patent US4459259A successfully refreshed from Google Patents.
← Back to Patent Explorer
US4459259A Expired / Lapsed US ⏱️ 0.0 years remaining

Digital computer operation of a nuclear reactor

Assignee: United States Department of Energy
•
Filing: 1982-06-29
•
Granted: 1984-07-10
•
Expires: 2002-06-29
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method is described for the safe operation of a complex system such as a nuclear reactor using a digital computer. The computer is supplied with a data base containing a list of the safe state of the reactor and a list of operating instructions for achieving a safe state when the actual state of the reactor does not correspond to a listed safe state, the computer selects operating instructions to return the reactor to a safe state.

Inventors

  • 👤 Robert W. Colley

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-27 14:12
CPC Classifications
G; G21; G21C; G21C7/00; G21C7/36; Y; Y02; Y02E; Y02E30/00; Y02E30/30; Y10; Y10S; Y10S706/00; Y10S706/902; Y10S706/903; Y10S706/906; Y10S706/907

Claims Analysis

Total Claims: 5
Claim 1
Independent Claim 196 words
A method of operating a nuclear reactor with the aid of a digital computer, comprising: (a) providing said computer with a data base including at least a list of safe reactor states, said safe reactor states being those combinations of individual reactor component states which are safe wherein said individual reactor components states are expressed as the binary notation (ab) where `a` defines the status of the components control switch and `b` defines the status of the component and wherein said list of safe reactor states is determined by combinatory logic operations upon said binary notation expression of said individual reactor component states, and a list of control instructions for achieving a safe reactor state; (b) repetitively determining the actual states of said individual reactor components; (c) repetitively providing the computer with said actual component states; (d) repetitively comparing in the computer said actual component states with said list of safe reactor states; (e) selecting in the computer operating instructions for achieving a safe reactor state from said list of control instructions when a said comparison indicates that said actual component states do not match a said safe reactor state; and (f) executing said operating instructions.
Claim 2
Independent Claim 196 words
A method of operating a nuclear reactor with the aid of a digital computer, comprising: (a) providing said computer with a data base including at least a list of safe reactor states, said safe reactor states being those combinations of individual reactor component states which are safe wherein said individual reactor components states are expressed as the binary notation (ab) where `a` defines the status of the components control switch and `b` defines the status of the component and wherein said list of safe reactor states is determined by combinatory logic operations upon said binary notation expression of said individual reactor component states, and a list of control instructions for achieving a safe reactor state; (b) repetitively determining the actual states of said individual reactor components; (c) repetitively providing the computer with said actual component states; (d) repetitively comparing in the computer said actual component states with said list of safe reactor states; (e) selecting in the computer operating instructions for achieving a safe reactor state from said list of control instructions when a said comparison indicates that said actual component states do not match a said safe reactor state; and (f) executing said operating instructions.
Claim 3
Independent Claim 232 words
A method of operating with the aid of a digital computer a complex system having a large number of components, each component having several possible states wherein said component states are expressed as the binary notation (ab) where `a` defines the status of the component's control switch and `b` defines the status of the components and an actual state; the system having a very large number of possible states based on all the possible combinations of the possible states of each component, a smaller number of safe system states wherein said safe system states are determined by combinatorial logic operations upon said binary notation expression of said component states and an actual system state based on the actual state of the components, comprising: (a) providing said computer with a data base including at least a list of said safe system states and a list of control instructions for achieving a safe system state; (b) repetitively determining the actual states of said components; (c) repetitively providing the computer with said actual component states; (d) repetitively comparing in the computer said actual component states with said list of safe system states; (e) selecting in the computer operating instructions for achieving a safe system state from said list of control instructions when a said comparison indicates that said actual component states do not match a said safe system state; and (f) executing said operating instruction.
Claim 4
Independent Claim 232 words
A method of operating with the aid of a digital computer a complex system having a large number of components, each component having several possible states wherein said component states are expressed as the binary notation (ab) where `a` defines the status of the component's control switch and `b` defines the status of the components and an actual state; the system having a very large number of possible states based on all the possible combinations of the possible states of each component, a smaller number of safe system states wherein said safe system states are determined by combinatorial logic operations upon said binary notation expression of said component states and an actual system state based on the actual state of the components, comprising: (a) providing said computer with a data base including at least a list of said safe system states and a list of control instructions for achieving a safe system state; (b) repetitively determining the actual states of said components; (c) repetitively providing the computer with said actual component states; (d) repetitively comparing in the computer said actual component states with said list of safe system states; (e) selecting in the computer operating instructions for achieving a safe system state from said list of control instructions when a said comparison indicates that said actual component states do not match a said safe system state; and (f) executing said operating instruction.
Claim 5
Dependent Claim 40 words
The method of claim 1 wherein the step of selecting in the computer operating instructions for achieving a safe system state comprises selecting those instructions which result in a minimum number of component changes in achieving a safe system state.

References Cited (Backward Citations)

US2553603A Cited
US3423285A Cited
US3518654A Cited
US3752735A Cited
US4080251A Cited
US4016034A Cited
US4129475A Cited
US4075059A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1987-07-10 1988-01-09 1988-07-10 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1991-07-10 1992-01-09 1992-07-10 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1995-07-10 1996-01-09 1996-07-10 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag