MétaCan
Menu
Back to cohort

Reasoning about Uncertainty over IoT Systems

2022· article· en· W4285813996 on OpenAlexaff
Ghalya Alwhishi, Jamal Bentahar, Nagat Drawel

Bibliographic record

Venue2022 International Wireless Communications and Mobile Computing (IWCMC) · 2022
Typearticle
Languageen
FieldComputer Science
TopicFormal Methods in Verification
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceScalabilityModel checkingInternet of ThingsSet (abstract data type)Block (permutation group theory)Model transformationReliability (semiconductor)Distributed computingCyber-physical systemTransformation (genetics)Formal verificationFormal methodsSoftware engineeringEmbedded systemTheoretical computer scienceArtificial intelligenceProgramming languageConsistency (knowledge bases)DatabaseOperating system

Abstract

fetched live from OpenAlex

The advent of the Internet of Things (IoT) has led to a rapid increase in the number of applications that are deployed within open and uncertain physical environments. The main challenge that faces IoT applications is how to ensure the reliability of the interaction between its different components. In this paper, we propose a practical and scalable approach that involves reasoning about uncertainty of these applications using multi-valued model checking. We introduce a building block for formal specification and automatic verification of IoT services in uncertain settings. After modeling and simulating a smart home framework behavior, we introduce a set of system specifications and verify whether the given framework meets those specifications. Finally, we present the experimental results obtained using a transformation algorithm and the NuSMV tool.

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.008
metaresearch head score (Gemma)0.030
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.008
Threshold uncertainty score0.043

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0080.030
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0010.001
Science and technology studies0.0010.004
Scholarly communication0.0040.005
Open science0.0020.004
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0020.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.

Opus teacher head0.022
GPT teacher head0.311
Teacher spread0.290 · 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 designTheoretical or conceptual
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

Citations4
Published2022
Admission routes1
Has abstractyes

Explore more

Same venue2022 International Wireless Communications and Mobile Computing (IWCMC)Same topicFormal Methods in VerificationFrench-language works237,207