MétaCan
Menu
Back to cohort
Record W2166909032 · doi:10.1109/cdc.2004.1428607

Fault diagnosis in hierarchical discrete-event systems

2006· article· en· W2166909032 on OpenAlexaff
A.M. Idghamishi, S. Hashtrudi Zad

Bibliographic record

Venue2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601) · 2006
Typearticle
Languageen
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceComputational complexity theoryFault (geology)Event (particle physics)State (computer science)Component (thermodynamics)Complex systemDistributed computingObservableTime complexityExponential functionTheoretical computer scienceAlgorithmArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

A framework for on-line passive fault diagnosis in hierarchical discrete-event systems (DES) is proposed. In this approach, the system model is broken into simpler substructures called D-holons. A state-based diagnoser is constructed for each D-holon. Fault diagnosis is accomplished using the state estimates provided by the D-holon diagnosers. At any given time, only a subset of the diagnosers are active, and as a result, instead of the entire model of the system, only the models of the D-holons associated with the active diagnosers are used. This reduces random access memory (RAM) requirements and thus, could be useful in complex multi-phase systems. Based on the D-holon model, the concept of phase-diagnosability is introduced to study failure diagnosability in cases where each component may be active only in some of the phases of operation. The computational complexity of constructing the transition systems required for diagnosis is exponential in the number of components. To reduce the computational complexity, we propose a semimodular approach with polynomial complexity for cases where interactions among system components are observable.

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 imitation

Not 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.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.004
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.023
GPT teacher head0.273
Teacher spread0.250 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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".

Quick stats

Citations20
Published2006
Admission routes1
Has abstractyes

Explore more

Same venue2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)Same topicPetri Nets in System ModelingFrench-language works237,207