MétaCan
Menu
Back to cohort
Record W4394581413 · doi:10.1002/adts.202300839

Building Models in Pairs for Cross‐Verification Using SDL and DEVS

2024· article· en· W4394581413 on OpenAlexaff
Pau Fonseca i Casas, Cristina Ruiz-Martín

Bibliographic record

VenueAdvanced Theory and Simulations · 2024
Typearticle
Languageen
FieldDecision Sciences
TopicSimulation Techniques and Applications
Canadian institutionsCarleton University
Fundersnot available
KeywordsDEVSComputer scienceProgramming languageModeling and simulationSimulation

Abstract

fetched live from OpenAlex

Abstract The objective of the paper is to present a methodology that can be used to translate a model from one formalism to another allowing model reuse and cross‐verification. With the use of formal languages, the model specifications can be expressed in a rigorous and univocal way, and the model can be validated against the specifications or conceptual model. Expressing the same model in different formal languages opens the conceptual model validation to a varied number of specialists. Also, in the context of modeling a new system, where there is no data to perform validation against a real system, having pairs of models can be used to perform cross‐model verification to ensure that the model specifications or conceptual models are correctly implemented by comparing the results produced by both models. Specifically, a method is presented to translate a model conceptualized on specification and description language (SDL) to discrete event system specification (DEVS). The transformation mechanism between SDL and DEVS formalisms is described. The methodology is exemplified with a disease spread model for COVID‐19, and it is shown how the results obtained by the two models can be used for cross‐verification.

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 imitation

Not 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.

metaresearch head score (Codex)0.011
metaresearch head score (Gemma)0.019
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.058

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0110.019
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0020.001
Science and technology studies0.0010.002
Scholarly communication0.0030.003
Open science0.0020.005
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0050.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.

Opus teacher head0.130
GPT teacher head0.481
Teacher spread0.351 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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
Published2024
Admission routes1
Has abstractyes

Explore more

Same venueAdvanced Theory and SimulationsSame topicSimulation Techniques and ApplicationsFrench-language works237,207