Test exhaustif de contrôleurs logiques spécifiés en Grafcet Apports et limites d'une modélisation par machines de Mealy
Bibliographic record
Abstract
Utilisés pour la commande des systèmes critiques, les contrôleurs logiques doivent faire l'objet de tests rigoureux pour garantir le respect du fonctionnement attendu.Dans ce but, nous proposons une méthode spécifique permettant un test de conformité exhaustif visà-vis de spécifications en Grafcet.Cette méthode s'appuie sur les travaux de la communauté informatique relatifs au test à partir de machines de Mealy.La mise en oeuvre sur des systèmes réels a mis en évidence certaines limites de telles approches pour le test de contrôleurs logiques.ABSTRACT.Logic controllers can be used for control of critical systems; in this case, they must be rigorously tested to ensure that they behave as specified.To meet this objective, this paper proposes a specific method to obtain an exhaustive conformance test for specifications given in SFC.This method relies on results of the computer science community on test of Mealy machines.Implementation on real systems has revealed some limitations of such approaches in the case of logic controllers, however.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.026 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".