Decentralized Supervisory Control of Discrete Event Systems: An Arborescent Architecture to Realize Inference-Based Control
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The two simplest language-based decentralized controls of discrete event systems are called conjunctive and permissive (C&P) and disjunctive and antipermissive (D&A) controls. On the other side, inference-based control is the most general language-based decentralized control. In this paper, we propose a decentralized control method, called arborescent control, which constructs and uses a tree-like control architecture that depends on the control objective. Each node π of the tree is a disjunction or conjunction of the enabling/disabling decisions of the two children of π. We show that if inference-based control is applicable to the control objective, then every leaf of the obtained tree is a C&P or D&A control. This means that by combining adequately C&P and D&A controls, we can realize every control objective that is realizable by inference-based control.
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.
Full frame distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it