MétaCan
Menu
Back to cohort
Record W7133028303

Fault-tolerant control in discrete-event systems

2004· dissertation· W7133028303 on OpenAlexfundno aff
William Kong-Iu Choi

Bibliographic record

VenueTSpace · 2004
Typedissertation
Language
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsnot available
FundersUniversity of Toronto
KeywordsControl reconfigurationControl systemState (computer science)Control theory (sociology)Control (management)Fault (geology)Fault tolerance
DOInot available

Abstract

fetched live from OpenAlex

Faults are common in complex systems. If not treated, faults in subsystems can propagate through the system and lead to catastrophic failures. Fault-tolerant control is therefore needed for system safety. Fault tolerance is the ability of a controlled system to maintain control objectives even if faults occurred. It can be obtained through fault-accommodation or reconfiguration, with acceptable degradation of performance. Fault-tolerant control has been studied over the last decade. It usually assumes that faults can be isolated and the system can be remedied after isolation. In this paper we relax these assumptions. By the techniques of fault diagnosis and state feedback control in a discrete-event framework, we introduce trace-feedback control for fault-tolerance. We define fault-accommodation and reconfiguration for systems with partial state information. Software procedures for control design are developed. A case study is provided to illustrate the design process.

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.004
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.009

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.001
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.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.019
GPT teacher head0.326
Teacher spread0.307 · 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

Citations0
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueTSpaceSame topicPetri Nets in System ModelingFrench-language works237,207