MétaCan
Menu
Back to cohort
Record W2163080024 · doi:10.1109/cdc.2000.912726

Effective control synthesis for DES under partial observations

2002· article· en· W2163080024 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
TopicPetri Nets in System Modeling
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsUndecidable problemExtension (predicate logic)String (physics)Finite-state machineDeterministic finite automatonSupervisory controlComputer scienceAutomatonRegular languageDiscrete mathematicsTimed automatonControl (management)Programming languageMathematicsAlgorithmTheoretical computer scienceDecidabilityArtificial intelligence

Abstract

fetched live from OpenAlex

A procedure is given for the effective solution of an infinite-string supervisory control problem under partial observations, for the case where the plant and specification languages are represented by finite /spl omega/-automata (automata on infinite strings), and the observation mask by a finite Moore automaton. This solves an /spl omega/-language version of the standard centralized supervisory control problem under partial observations. It is shown that a natural extension to decentralized control is undecidable, even if the plant, the specification languages and the masks are represented by finite automata. This undecidability result carries over to the finite-string case.

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.000
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.918
Threshold uncertainty score0.312

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
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.085
GPT teacher head0.265
Teacher spread0.181 · 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

Quick stats

Citations48
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicPetri Nets in System ModelingFrench-language works237,207