Goal and Feature Model Optimization for the Design and Self-Adaptation of Socio-Cyber-Physical Systems
Bibliographic record
Abstract
Socio-cyber-physical systems (SCPSs) are cyber-physical systems with social concerns. Many emerging SCPSs, often qualified as “smart”, need such concerns to be addressed not only at design time but also at runtime, often by adapting dynamically to surrounding contexts, to keep providing optimal value to users. A comprehensive requirements and design modeling approach is needed to incorporate social concerns (e.g., using goal modeling) into SCPS development activities. This paper introduces an optimization method that provides design-time and runtime solutions for self-adaptive SCPSs while supporting the validation of their design models. The method helps satisfying the goals of the SCPS and its stakeholders by monitoring the system’s environment and qualities, while enforcing correctness constraints specified in a feature model. We integrate arithmetic functions generated automatically from goal and feature models to build a combined goal-feature model and synchronize the values of the features shared between i) the objective function represented by goal functions, and ii) the constraints represented by feature functions. The goal-feature model is solved by an optimization tool (IBM CPLEX) in order to calculate optimal adaptation solutions for common situations at design time. Runtime optimization is also used by the system for adapting to situations unanticipated during design. We use a Smart Home Management System case study to assess how well the method can be used to manage selection among alternatives according to monitored environmental conditions while solving emergent conflicts. Further experiments on the use of the method for runtime adaptation show good performance for realistic models and good scalability overall. Some remaining challenges and limitations exist, including the availability of quantitative models as inputs.
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.003 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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 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".