Opacity problems in multi-energy timed automata

• URL: http://arxiv.org/abs/2512.04950v1
• Date: Thu, 04 Dec 2025 16:15:48 GMT
• Title: Opacity problems in multi-energy timed automata
• Abstract summary: We study the verification of opacity problems over systems with observation over both timing and energy information.<n>Despite undecidability of this general formalism, we establish positive results over a number of subclasses.
• Score: 1.4732811715354452
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cyber-physical systems can be subject to information leakage; in the presence of continuous variables such as time and energy, these leaks can be subtle to detect. We study here the verification of opacity problems over systems with observation over both timing and energy information. We introduce guarded multi-energy timed automata as an extension of timed automata with multiple energy variables and guards over such variables. Despite undecidability of this general formalism, we establish positive results over a number of subclasses, notably when the attacker observes the final energy and/or the execution time, but also when they have access to the value of the energy variables every time unit.

Related papers

• Keep the Lights On, Keep the Lengths in Check: Plug-In Adversarial Detection for Time-Series LLMs in Energy Forecasting [35.31487571405278]
  We propose a plug-in detection framework that capitalizes on the TS-LLM's own variable-length input capability.<n>We evaluate our approach on three representative TS-LLMs across three energy datasets.
  arXiv  Detail & Related papers  (2025-12-13T03:24:36Z)
• The Bright Side of Timed Opacity [0.0]
  Timed automata (TAs) are an extension of finite automata that can measure and react to the passage of time.<n>In 2009, Franck Cassez showed that the timed opacity problem, where an attacker can observe some actions with their timestamps and attempts to deduce information, is undecidable for TAs.<n>We consider the same definition of opacity, by restricting either the system or the attacker.
  arXiv  Detail & Related papers  (2024-08-22T09:17:59Z)
• Quantum information scrambling in adiabatically-driven critical systems [49.1574468325115]
  Quantum information scrambling refers to the spread of the initially stored information over many degrees of freedom of a quantum many-body system. Here, we extend the notion of quantum information scrambling to critical quantum many-body systems undergoing an adiabatic evolution.
  arXiv  Detail & Related papers  (2024-08-05T18:00:05Z)
• Expiring opacity problems in parametric timed automata [0.0]
  We study expiring timed opacity problems in timed automata. We consider the set of time bounds for which a system is opaque and show when they can be effectively computed for timed automata.
  arXiv  Detail & Related papers  (2024-03-12T13:30:53Z)
• TimeXer: Empowering Transformers for Time Series Forecasting with Exogenous Variables [75.83318701911274]
  TimeXer ingests external information to enhance the forecasting of endogenous variables. TimeXer achieves consistent state-of-the-art performance on twelve real-world forecasting benchmarks.
  arXiv  Detail & Related papers  (2024-02-29T11:54:35Z)
• Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed Automata [2.2003515924552044]
  Timed automata are an extension of finite-state automata with a set of clocks evolving linearly. We use timed automata as the input formalism, in which we assume that the attacker has access only to the system execution time.
  arXiv  Detail & Related papers  (2023-10-31T12:10:35Z)
• Follow Anything: Open-set detection, tracking, and following in real-time [89.83421771766682]
  We present a robotic system to detect, track, and follow any object in real-time. Our approach, dubbed follow anything'' (FAn), is an open-vocabulary and multimodal model. FAn can be deployed on a laptop with a lightweight (6-8 GB) graphics card, achieving a throughput of 6-20 frames per second.
  arXiv  Detail & Related papers  (2023-08-10T17:57:06Z)
• Learning quantum systems via out-of-time-order correlators [0.27961972519572437]
  We show that out-of-time-order correlators can substantially improve the learnability of strongly-interacting systems. We numerically characterize these advantages across a variety of learning problems, and find that they are robust to both read-out error and decoherence.
  arXiv  Detail & Related papers  (2022-08-03T18:00:00Z)
• Explaining Time Series Predictions with Dynamic Masks [91.3755431537592]
  We propose dynamic masks (Dynamask) to explain predictions of a machine learning model. With synthetic and real-world data, we demonstrate that the dynamic underpinning of Dynamask, together with its parsimony, offer a neat improvement in the identification of feature importance over time. The modularity of Dynamask makes it ideal as a plug-in to increase the transparency of a wide range of machine learning models in areas such as medicine and finance.
  arXiv  Detail & Related papers  (2021-06-09T18:01:09Z)
• Bridging the Gap Between the Transient and the Steady State of a Nonequilibrium Quantum System [58.720142291102135]
  Many-body quantum systems in nonequilibrium remain one of the frontiers of many-body physics. Recent work on strongly correlated electrons in DC electric fields illustrated that the system may evolve through successive quasi-thermal states. We demonstrate an extrapolation scheme that uses the short-time transient calculation to obtain the retarded quantities.
  arXiv  Detail & Related papers  (2021-01-04T06:23:01Z)
• Energy Aware Deep Reinforcement Learning Scheduling for Sensors Correlated in Time and Space [62.39318039798564]
  We propose a scheduling mechanism capable of taking advantage of correlated information. The proposed mechanism is capable of determining the frequency with which sensors should transmit their updates. We show that our solution can significantly extend the sensors' lifetime.
  arXiv  Detail & Related papers  (2020-11-19T09:53:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.