MétaCan
Menu
Back to cohort
Record W1804074617 · doi:10.1109/cira.1999.809985

Moore automata for flexible routing and flow control in manufacturing workcells

2003· article· en· W1804074617 on OpenAlexaff
Alejandro Jesús Robles Ramírez, Songwei Zhu, B. Benhabib

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsUniversity of Toronto
FundersConsejo Nacional de Ciencia y Tecnología
KeywordsAutomatonFlexibility (engineering)Computer scienceRouting (electronic design automation)Flow (mathematics)Control (management)Automata theoryControl flowDistributed computingEvent (particle physics)Control engineeringTheoretical computer scienceEngineeringEmbedded systemProgramming languageMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

The potential of flexible-manufacturing workcells (FMCs) to produce a family of parts in many possible orders of operations and choices of different machines is advantageous. Despite intensive research on the theoretical control of discrete-event systems, however, current techniques can still only be used for the supervisory control of simple cells. In this article, a novel modeling and control synthesis technique is presented for FMCs that allow part-routing flexibility. Our proposed methodology combines extended Moore automata and controlled-automata theories to synthesize supervisors for such FMCs.

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.000
metaresearch head score (Gemma)0.001
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.002
Threshold uncertainty score0.007

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.001
Bibliometrics0.0000.000
Science and technology studies0.0000.001
Scholarly communication0.0010.001
Open science0.0010.000
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.020
GPT teacher head0.246
Teacher spread0.226 · 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

Citations7
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicPetri Nets in System ModelingFrench-language works237,207