Formal reliability and failure analysis of ethernet based communication networks in a smart grid substation
Bibliographic record
Abstract
Abstract Secure and continuous operation of a smart grid substation mainly depends upon the reliable functioning of its communication network. The communication system of a smart substation is typically based on a high performance Ethernet communication network that connects various intelligent embedded devices, such as Intelligent Electronic Devices (IED) andMerging Units (MU), to ensure continuous monitoring, automation and efficient demand response of the smart substation. Traditionally, Reliability Block Diagram (RBD) and Fault Tree (FT) methods are used to develop reliability and failure models for these communication networks by considering the failure characteristics of their substation intelligent embedded devices and other components, like transformers and circuit breakers. These resulting reliability and failure models are then analyzed using paper-and-pencil methods or computer simulations, but they cannot assure accuracy in the analysis due to their inherent limitations. As an accurate alternative, we propose a methodology, based on higher-order logic theorem proving, for conducting the formal RBD and FT-based reliability and failure analysis of smart substation communication networks, respectively. This paper also describes a sound transformation of smart grid FT models to their equivalent RBDs - a well-known method to reduce the complexity of FT-based failure analysis. Some ML-based tactics have been developed to automatically compute the reliability and failure probability of smart grid substations for practical purposes.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.002 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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".