MétaCan
Menu
Back to cohort

Dynamic Fault Tree Analysis and Risk Mitigation Strategies of Data Communication System via Statistical Model Checking

2021· article· en· W3175914189 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicSoftware Reliability and Analysis Research
Canadian institutionsConcordia University
Fundersnot available
KeywordsFault tree analysisComputer scienceRedundancy (engineering)Modular designReliability engineeringTriple modular redundancyModel checkingReliability (semiconductor)Critical systemLife-critical systemFault toleranceFault detection and isolationDistributed computingEngineeringTheoretical computer scienceSoftware engineeringArtificial intelligence

Abstract

fetched live from OpenAlex

Fault Tree Analysis (FTA) is a widely used technique to assess the reliability of safety-critical systems. The conventional FTA approaches are based on simulation and often require extensive computing capabilities. In this paper, a model checking based technique is proposed to examine the probability of safety-critical systems failure. The proposed approach uses the advantages of both dynamic FTA and statistical model checking (SMC). In order to illustrate our proposed approach, the sources of failure in Data Communication System (DCS) are analyzed. After detecting the critical causes of system failure, several redundant architectures based on Triple Modular Redundancy (TMR) are investigated to assess their capabilities of risk mitigation.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.762
Threshold uncertainty score0.275

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0010.001
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.030
GPT teacher head0.330
Teacher spread0.300 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it