MétaCan
Menu
Back to cohort
Record W2546447209 · doi:10.1109/ccece.2016.7726653

Computational procedures for robust nonblocking supervisory control

2016· article· en· W2546447209 on OpenAlexaff
Farid Yari, Shahin Hashtrudi-Zad

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicPetri Nets in System Modeling
Canadian institutionsConcordia University
Fundersnot available
KeywordsSupervisory controlDiscrete event dynamic systemComputer scienceBounded functionEvent (particle physics)State (computer science)Robust controlDiscrete event simulationControl (management)Mathematical optimizationDiscrete time and continuous timeAlgorithmControl theory (sociology)Distributed computingControl systemTheoretical computer scienceDiscrete systemMathematicsEngineeringSimulationArtificial intelligence

Abstract

fetched live from OpenAlex

In this paper an iterative procedure is developed for obtaining the maximally permissive solution for the problem of robust nonblocking supervisory control of discrete-event systems assuming full event observation. In the robust control problem, the plant model belongs to a finite family of discrete-event models, each with its own design specification. It is shown that the procedure developed in this paper converges in a bounded number of steps for finite-state plant models and regular specification languages.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.716
Threshold uncertainty score0.285

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.046
GPT teacher head0.253
Teacher spread0.207 · 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
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicPetri Nets in System ModelingFrench-language works237,207