CORTEXA
← Browse
arxivcs.OSeess.SY2026-06-30

Ensuring Deterministic Timing in a Federated GNSS Correction Pipeline with Lingua Franca

Tejeswini Jayaramareddy, Hokeun Kim, Hoeseok Yang

Embedded systems that combine hardware interrupts, buffering, and distributed communication are often perceived as inherently asynchronous and difficult to analyze. However, such systems can exhibit a deterministic timing structure when modeled using explicit logical-time semantics. This paper presents a Global Navigation Satellite System (GNSS) correction-data pipeline implemented as a federated Lingua Franca (LF) application. The federated LF program decomposes the end-to-end pipeline into reactors with explicit time semantics, including a time-triggered GNSS receiver, a UART interrupt stream derived from baud rate and First-In First-Out (FIFO) buffer characteristics, a periodic forwarding task, and downstream processing with jitter monitoring. Federated execution and runtime logs validate the analytically derived deterministic timing structure-including interrupt cadence, ring-buffer evolution, packetization behavior, and physical--logical jitter-yielding a reproducible and predictable timing profile.

View free PDFSource page

Related papers

arxiveess.SYcs.OS2026-07-14

SynapticOS: An Inference-First Runtime Architecture for Neural Processing Units on Resource-Constrained Microcontrollers

Dimitrios Kafetzis

Microcontrollers with on-die neural processing units (NPUs) have become mainstream, but the system software hosting them has not: production combinations of Zephyr or FreeRTOS with TensorFlow Lite Micro treat AI inference as an application-layer library, leaving memory fragmentat…

View free PDFSource page
arxiveess.SY2026-07-23

A scalable and resource-efficient pipelined p-computer for probabilistic Ising machines

Deborah Volpe, Eleonora Raimondo, Andrea Grimaldi, Pedram Khalili Amiri, Stefano Chiappini, Anna Giordano, et al.

Probabilistic Ising machines (PIMs) based on probabilistic bits offer a hardware-friendly route to solve combinatorial optimization problems, but most digital implementations achieve high throughput by exploiting sparse interactions. This limits their applicability to dense probl…

View free PDFSource page
arxivcs.ROcs.HCeess.SY2026-07-15

Zero2Skill: Bootstrapping Robot Skills through Autonomous Data Collection, Training, and Deployment

Boyuan Wang, Zhenyuan Zhang, Zhiqin Yang, Peijun Gu, Shuya Wang, Xiaofeng Wang, et al.

Autonomous data collection governs the volume and quality of real-world trajectories for manipulation policy learning. Existing pipelines reduce human effort via self-resetting, VLM verification, or language-guided correction, yet episode-scoped fixes must be reissued whenever th…

View free PDFSource page
arxivcs.CCeess.SY2026-07-14

Bounded Analog Complexity

Ho-Lin Chen, Xiang Huang

Current analog complexity theory, built on the General-Purpose Analog Computer (GPAC) model and polynomial ODEs, allows unbounded state variables -- an assumption that is physically unrealistic for chemical reaction networks and other laboratory-scale analog computers. We develop…

View free PDFSource page
arxiveess.SYmath.OC2026-07-17

Gaussian behaviors and stochastic data-driven control

András Sasfi, Alberto Padoan, Ivan Markovsky, Florian Dörfler

We propose a stochastic behavioral modeling framework, termed Gaussian behaviors, which augments a deterministic linear time-invariant (LTI) behavior with a Gaussian noise component. We show that this notion is a tractable subclass of stochastic behaviors and encompasses classica…

View free PDFSource page