MétaCan
Menu
Back to cohort
Record W2151229401 · doi:10.1109/efta.2007.4416834

Analytical method for generating feasible control sequences in controller development

2007· article· en· W2151229401 on OpenAlexaff
Jesús Trujillo, Zbigniew J. Pasek, Enrique Baeyens

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsControl reconfigurationComputer scienceController (irrigation)ExploitTree (set theory)SupervisorTree structureFunction (biology)Control engineeringDistributed computingAlgorithmEmbedded systemBinary treeEngineeringMathematics

Abstract

fetched live from OpenAlex

This paper introduces an analytical method to provide feasible and rapid control reconfiguration. The controls for reconfigurable manufacturing systems have to be capable not only of identifying exceptions on-line, but also simultaneously developing on-line strategies for dealing with unpredictable customer orders or inaccurate estimates of processing times. The approach exploits the generation of virtual supervisor (VS) tree and offers several algorithms for developing reference patterns, which recognize safe and feasible sequences. The VS tree has the function of creating the basic structure, including all of the possible loops in the finite position machine FPMfor developing feasible controllers.

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 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.005
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: Methods
Teacher disagreement score0.877
Threshold uncertainty score0.459

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0050.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.0010.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.057
GPT teacher head0.350
Teacher spread0.293 · 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 teacher head, not a consensus.

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

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

Citations2
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicPetri Nets in System ModelingFrench-language works237,207