MétaCan
Menu
Back to cohort
Record W2153074510 · doi:10.1109/ictai.2009.112

Runtime Monitoring of Multi-agent Manufacturing Systems for Deadlock Detection Based on Models

2009· article· en· W2153074510 on OpenAlexafffund
Nariman Mani, Vahid Garousi, Behrouz H. Far

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsUniversity of Calgary
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsDeadlock prevention algorithmsDeadlockComputer scienceDistributed computingAutomationLimitingOverhead (engineering)Multi-agent systemEmbedded systemEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

There is an increasing demand for the multi-agent systems (MAS) in the automation of manufacturing systems. However, similar to other distributed systems, autonomous agents' interaction in the automated manufacturing systems (AMS) can potentially lead to runtime behavioral failures including deadlock. Deadlocks can cause major financial consequences by negatively affecting the production cost and time. Therefore, a multi-agent manufacturing system should be monitored against the unwanted emergent behaviors such as deadlocks. In this paper, we propose a monitoring technique for deadlock detection in multi-agent manufacturing system based on the MAS design models. In this technique, the MAS is instrumented with a dedicated communication protocol to use the potential deadlock information derived from the design models to propagate deadlock detection query messages. The technique is able to reduce the message communication overhead among the agents by limiting the number of agents that the deadlock detection query messages should be initiated to.

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.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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.834
Threshold uncertainty score0.619

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.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.275
Teacher spread0.218 · 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

Citations1
Published2009
Admission routes2
Has abstractyes

Explore more

Same topicPetri Nets in System ModelingFrench-language works237,207