Zobrazeno 1 - 10
of 121
pro vyhledávání: '"LIME, Didier"'
Publikováno v:
EPTCS 392, 2023, pp. 1-26
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 a set of c
Externí odkaz:
http://arxiv.org/abs/2310.20392
Ensuring the correctness of critical real-time systems, involving concurrent behaviors and timing requirements, is crucial. Timed automata extend finite-state automata with clocks, compared in guards and invariants with integer constants. Parametric
Externí odkaz:
http://arxiv.org/abs/2310.09109
Publikováno v:
ACM Transactions on Software Engineering and Methodology (ToSEM), Volume 31(4), 2022
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 consider that
Externí odkaz:
http://arxiv.org/abs/2206.05438
Publikováno v:
Fundamenta Informaticae, Volume 183, Issues 1-2: Petri Nets 2019 (December 23, 2021) fi:8464
We investigate the problem of parameter synthesis for time Petri nets with a cost variable that evolves both continuously with time, and discretely when firing transitions. More precisely, parameters are rational symbolic constants used for time cons
Externí odkaz:
http://arxiv.org/abs/2109.03658
Publikováno v:
Logical Methods in Computer Science, Volume 18, Issue 1 (February 9, 2022) lmcs:6312
We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable. Notably, the parametric reachability emp
Externí odkaz:
http://arxiv.org/abs/2004.09171
The verification of systems combining hard timing constraints with concurrency is challenging. This challenge becomes even harder when some timing constants are missing or unknown. Parametric timed formalisms, such as parametric timed automata (PTAs)
Externí odkaz:
http://arxiv.org/abs/1908.06633
Publikováno v:
Transactions on Petri Nets and Other Models of Concurrency, volume 14, pages 64-100, November 2019
This paper constitutes a short introduction to parametric verification of concurrent systems. It originates from two 1-day tutorial sessions held at the Petri nets conferences in Toru\'n (2016) and Zaragoza (2017). The paper presents not only the bas
Externí odkaz:
http://arxiv.org/abs/1907.00555
Publikováno v:
Logical Methods in Computer Science, Volume 17, Issue 2 (May 10, 2021) lmcs:5799
We introduce a new class of Parametric Timed Automata (PTAs) where we allow clocks to be compared to parameters in guards, as in classic PTAs, but also to be updated to parameters. We focus here on the EF-emptiness problem: "is the set of parameter v
Externí odkaz:
http://arxiv.org/abs/1904.08824
Risk assessment of cyber-physical systems, such as power plants, connected devices and IT-infrastructures has always been challenging: safety (i.e. absence of unintentional failures) and security (i.e. no disruptions due to attackers) are conditions
Externí odkaz:
http://arxiv.org/abs/1902.04336
In this paper we consider state reachability in networks composed of many identical processes running a parametric timed broadcast protocol (PTBP). PTBP are a new model extending both broadcast protocols and parametric timed automata. This work is, u
Externí odkaz:
http://arxiv.org/abs/1811.12576