ICONE23-1952 Co-Simulation for Real Time Safety Verification of Nuclear Power Plants
Notice bibliographique
Résumé
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 instrumentations. 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 all possible fault propagation scenarios and the interrelationships among associated process variables. Safety and protection layers along with their reliability are mapped to FSN so that safety levels can be verified during plant operation. Errors between multiphysics models and real time data are modeled to accurately and dynamically tune FSN for each fault propagation scenario. The detailed methodology will show how to integrate process models, construction of static FSN with fault propagation scenarios, and evaluation and tuning of dynamic FSN with probabilistic and process variable interaction values. Principle Component Analysis method is used reduce dimensionality and reduce process variables associated with each fault scenario. Then map independent protection layers (IPL) to FSN with estimated reliability measures of each protection layer to accurately verify safety for different operational scenarios. Intelligent algorithms is used with multivariate techniques to accurate define the interrelation among process variables, in terms of signal strength and time delay, using Genetic Programming (GP), which will provide basis for fault detection and tuning of FSN, as well as fault diagnosis to understand the closest state of fault scenario. Intelligent algorithm for Bayesian Believe Networks (BBN) is developed to estimate probabilities associated with dynamic FSN with priori and posteriori probabilities. This will dynamically tune FSN with probabilities and real time and simulation data. Probabilistic risk are estimated for each propagation scenario along with the reliabilities of associated IPLs. This will accurately verify safety for all propagation scenarios during plant operation and maintenance. And in order to fine tune propagation scenarios within FSN, rules are synthesized using fuzzy logic using real time and simulation data.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Comment cette classification a été obtenuedéplier
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,000 | 0,000 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,001 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découleClassification
machine, non validéePrédiction automatique; un appel candidat d’une seule tête enseignante, pas un consensus.
Le détail, modèle par modèle et score par score, se trouve en fin de page sous « Comment cette classification a été obtenue ».