Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/ ZENODOarrow_drop_down
image/svg+xml art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos Open Access logo, converted into svg, designed by PLoS. This version with transparent background. http://commons.wikimedia.org/wiki/File:Open_Access_logo_PLoS_white.svg art designer at PLoS, modified by Wikipedia users Nina, Beao, JakobVoss, and AnonMoos http://www.plos.org/
ZENODO
Dataset
Data sources: ZENODO
addClaim

Toward Topological Coherence in Critical Cyber-Physical Architectures A Contract-Based Framework with Preliminary HIL Evidence Using Frama-C and Memristive Computing Primitives

Authors: Nour kayad, Mohamed; John Burlingame, Davis;

Toward Topological Coherence in Critical Cyber-Physical Architectures A Contract-Based Framework with Preliminary HIL Evidence Using Frama-C and Memristive Computing Primitives

Abstract

Critical cyber-physical systems (CPS) require evidence that spans software correctness, timing behavior, communication discipline, and hardware eciency. This paper proposes a verication-oriented framework for what we term topological coherence, understood operationally as the consistency of constraints and state transformations across heterogeneous CPS layers. Rather than claiming full end-to-end certication, we present a contract-based methodology that links representative ISO C kernels, ACSL specications, Frama-C analysis, and hardware-in-the-loop (HIL) observations collected on an evaluated setup. Four illustrative layers are considered: a sample-preserving medical rectier, a bounded queue admission module, a memristive crossbar computation kernel, and a swarm-state normalization core. We show how preconditions, postconditions, frame conditions, and loop invariants can be used to formalize implementation-level obligations, while experimental observations provide workload-specic evidence regarding latency, queue behavior, and eciency. The contribution of the paper is methodological: it oers a reproducible way to align architectural intent, low-level code, and preliminary HIL measurements without overstating what formal proof or empirical testing alone can establish

Powered by OpenAIRE graph
Found an issue? Give us feedback