Co-simulation for real time safety verification of nuclear power plants
Bibliographic record
Abstract
Small and major accidents and near misses are still occurring in nuclear power plants (NPPs). Risk level has increased with the degradation of NPP equipment and instrumentation. In order to achieve NPP safety, it is important to continuously evaluate risk for all potential hazard and fault propagation scenarios and map protection layers to fault / failure / hazard propagation scenarios to be able to evaluate and verify safety level during NPP operation. There are major limitations in current real time safety verification tools, as it is mainly offline and with no integration to NPP simulation tools. The main goal of this research is to develop real time safety verification with co-simulation tool to be integrated with plant operation support systems. This includes the development of static and dynamic fault semantic network (FSN) to model possible fault propagation scenarios and the interrelationships among associated process variables. The detailed methodology involves the integration of process models, construction of static FSN with fault propagation scenarios, and evaluation and tuning of dynamic FSN with probabilistic and process variable interaction values. The focus however of the present study is to highlight the need to incorporate error reduction in performing safety verification of NPPs. Two selected case studies were used to demonstrate the proposed methodology; one on a turbine trip and the other on steam generator tube rupture. In the former case, the error reduction concept was shown while the safety verification method was demonstrated in the latter case. The results confirmed the importance of error reduction as well as the need to constantly undertake safety verification of safety critical systems such as a NPP.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".