English
Related papers

Related papers: Execution-time opacity control for timed automata

200 papers

Timing information leakage occurs whenever an attacker successfully deduces confidential internal information by observing some timed information such as events with timestamps. Timed automata are an extension of finite-state automata with…

Logic in Computer Science · Computer Science 2023-11-01 Étienne André , Engel Lefaucheux , Didier Lime , Dylan Marinho , Jun Sun

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage occurs whenever an attacker successfully deduces confidential internal information. In this work, we…

Cryptography and Security · Computer Science 2022-10-05 Étienne André , Didier Lime , Dylan Marinho , Jun Sun

Information leakage can have dramatic consequences on systems security. Among harmful information leaks, the timing information leakage is the ability for an attacker to deduce internal information depending on the system execution time. We…

Cryptography and Security · Computer Science 2020-10-20 Étienne André , Jun Sun

Information leakage can have dramatic consequences on the security of real-time systems. Timing leaks occur when an attacker is able to infer private behavior depending on timing information. In this work, we propose a definition of…

Logic in Computer Science · Computer Science 2024-03-13 Étienne André , Engel Lefaucheux , Dylan Marinho

Timed automata (TAs) are an extension of finite automata that can measure and react to the passage of time, providing the ability to handle real-time constraints using clocks. In 2009, Franck Cassez showed that the timed opacity problem,…

Logic in Computer Science · Computer Science 2026-03-30 Étienne André , Sarah Dépernet , Engel Lefaucheux

We introduce a prototype tool strategFTO addressing the verification of a security property in critical software. We consider a recent definition of timed opacity where an attacker aims to deduce some secret while having access only to the…

Cryptography and Security · Computer Science 2022-11-28 Étienne André , Shapagat Bolat , Engel Lefaucheux , Dylan Marinho

This paper investigates the decidability of opacity in timed automata (TA), a property that has been proven to be undecidable in general. First, we address a theoretical gap in recent work by J. An et al. (FM 2024) by providing necessary…

Systems and Control · Electrical Eng. & Systems 2025-04-02 Weilin Deng , Daowen Qiu , Jingkai Yang

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…

Cryptography and Security · Computer Science 2025-12-05 Étienne André , Lydia Bakiri

Parametric timed automata (PTAs) extend the concept of timed automata, by allowing timing delays not only specified by concrete values but also by parameters, allowing the analysis of systems with uncertainty regarding timing behaviors. The…

Formal Languages and Automata Theory · Computer Science 2024-10-03 Étienne André , Johan Arcile , Engel Lefaucheux

Opacity is an information flow property characterizing whether a system reveals its secret to an intruder. Verification of opacity for discrete-event systems modeled by automata is in general a hard problem. We discuss the question whether…

Formal Languages and Automata Theory · Computer Science 2019-12-17 Jiří Balun , Tomáš Masopust

Timed automata are a common formalism for the verification of concurrent systems subject to timing constraints. They extend finite-state automata with clocks, that constrain the system behavior in locations, and to take transitions. While…

Cryptography and Security · Computer Science 2022-06-08 Johan Arcile , Étienne André

Qualitative opacity of a secret is a security property, which means that a system trajectory satisfying the secret is observation-equivalent to a trajectory violating the secret. In this paper, we study how to synthesize a control policy…

Formal Languages and Automata Theory · Computer Science 2024-12-04 Sumukha Udupa , Jie Fu

Timed automata (TA) have been widely adopted as a suitable formalism to model time-critical systems. Furthermore, contemporary model-checking tools allow the designer to check whether a TA complies with a system specification. However, the…

Logic in Computer Science · Computer Science 2023-06-22 Jaroslav Bendík , Ahmet Sencan , Ebru Aydin Gol , Ivana Černá

Attacks, including the manipulation of sensor readings and the modification of actuator commands, pose a significant challenge to the security and privacy of automated systems. This paper considers discrete event systems that can be modeled…

Formal Languages and Automata Theory · Computer Science 2025-10-28 Xiaoyan Li , Christoforos N. Hadjicostis

Timed automata (TA) is used for modeling systems with timing aspects. A TA extends a finite automaton with a set of real valued variables called clocks, that measure the time and constraints over the clocks guard the transitions. A…

Formal Languages and Automata Theory · Computer Science 2021-04-20 Ebru Aydin Gol

Leaking information about the execution behavior of critical real-time tasks may lead to serious consequences, including violations of temporal constraints and even severe failures. We study information leakage for a special class of…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-06-05 Mohammad Fakhruddin Babar , Zain A. H. Hammadeh , Mohammad Hamad , Monowar Hasan

Probabilistic timed automata (PTAs) are timed automata (TAs) extended with discrete probability distributions.They serve as a mathematical model for a wide range of applications that involve both stochastic and timed behaviours. In this…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Hongfei Fu , Yi Li , Jianlin Li , Lijun Zhang

Opacity is a property of privacy and security applications asking whether, given a system model, a passive intruder that makes online observations of system's behaviour can ascertain some "secret" information of the system. Deciding opacity…

Formal Languages and Automata Theory · Computer Science 2023-04-21 Jiří Balun , Tomáš Masopust , Petr Osička

Consider a stochastic process being controlled across a communication channel. The control signal that is transmitted across the control channel can be replaced by a malicious attacker. The controller is allowed to implement any arbitrary…

Optimization and Control · Mathematics 2017-04-05 Cheng-Zong Bai , Fabio Pasqualetti , Vijay Gupta

Controller confidentiality under sensor attacks refers to whether the internal states of the controller can be estimated when the adversary knows the model of the plant and controller, while only having access to sensors, but not the…

Optimization and Control · Mathematics 2022-02-02 Michelle S. Chong
‹ Prev 1 2 3 10 Next ›