A method for the modular synthesis of controllers for timed discrete-event systems
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
A method for the modular supervisory control of timed discrete-event systems (TDES) is presented. The modular synthesis method is an extension of the centralized synthesis method proposed in our earlier work. We consider a state predicate specification as a conjunction of several state subpredicate specifications. The control problem is to synthesize a modular controller, the conjunction of all individual controllers, in such a way that the closed-loop behaviour of TDES satisfies the state predicate specification. Our modular synthesis method is developed based on the concept of state space of TDES, the notion of control-invariant state predicates for the TDES and a fixed point algorithm to calculate a control-invariant state subpredicate of a given state predicate. In addition, for the development of our modular synthesis method, we introduce the notion of control-invariance non-conflict among control-invariant state predicates, and the notion of forcing-non-conflict among controllers synthesized based on control-invariant state predicates which are control-invariance non-conflicting. The modular synthesis method in general offers better design flexibility and may require fewer computations than the centralized one. As in our centralized synthesis method, the proposed modular synthesis method does not require the construction and examination of complete sequences of event trajectories of the system. It is suggested that the computation of our proposed method of yielding solutions for a class of synthesis problems in TDES can be economical.
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.004 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 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