MétaCan
Menu
Back to cohort
Record W1967170869 · doi:10.1109/indin.2009.5195874

Reactive business processes for factory automation

2009· article· en· W1967170869 on OpenAlexaff
Domnic Savio, Stamatis Karnouskos, Luciana Moreira Sá de Souza, Vlad Trifa, Dominique Guinard, Patrik Spieß

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicFlexible and Reconfigurable Manufacturing Systems
Canadian institutionsSystems, Applications & Products in Data Processing (Canada)Research Canada
FundersEuropean Commission
KeywordsDynamismModular designComputer scienceBusiness processArtifact-centric business process modelBusiness process modelingFactory (object-oriented programming)AutomationBusiness Process Model and NotationProduction (economics)Process managementProduction lineProcess (computing)Business ruleWork (physics)Industrial engineeringManufacturing engineeringWork in processBusinessOperations managementEngineeringOperating system

Abstract

fetched live from OpenAlex

Modern enterprises operate on a global scale and depend on complex business processes. Business continuity needs to be guaranteed, while changes at the shop floor should happen on-the-fly without stopping the production process. Unfortunately, the existing business processes found in most enterprises are not modular enough, nor they have dynamic support from the device level. However, as the number of sophisticated networked embedded devices in the shop-floor increases, SOA concepts can now be pushed down and provide a better collaboration between the business systems and the production line. This leads to highly dynamic systems that can adapt and optimize their behavior to achieve their goals. The work presented here shows directions to achieve this dynamism by means of simulation, state identification and close coupling of real world and business systems.

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.002
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.010
Threshold uncertainty score0.034

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0050.004
Open science0.0020.002
Research integrity0.0030.004
Insufficient payload (model declined to judge)0.0100.003

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.012
GPT teacher head0.212
Teacher spread0.200 · 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

Citations2
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicFlexible and Reconfigurable Manufacturing SystemsFrench-language works237,207