10 citations · 44 across the 15 of their papers we have counts for
22 papers
Whitney--Lagrange Decomposition for the First Family of Finite Element Differential Forms
Long Chen, Xuehai Huang
We derive polynomial bubble duality in barycentric coordinates and construct explicit nodal bases for the first family of finite element differential forms. Logarithmic coordinates…
Buffered control for opacity in timed automata
Étienne André, Sarah Dépernet, Engel Lefaucheux
Timed automata are an extension of finite automata that can measure and react to the passage of time, handling real-time constraints by using clocks. The timed opacity problem, whe…
Parametric disjunctive timed networks
Étienne André, Swen Jacobs, Engel Lefaucheux
We consider distributed systems with an arbitrary number of processes, modelled by timed automata that communicate through location guards: a process can take a guarded transition…
Execution-time opacity problems in one-clock parametric timed automata
Étienne André, Johan Arcile, Engel Lefaucheux
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…
Execution-time opacity control for timed automata
Étienne André, Marie Duflot, Laetitia Laversa +1
Timing leaks in timed automata (TA) can occur whenever an attacker is able to deduce a secret by observing some timed behaviour. In execution-time opacity, the attacker aims at ded…
The Bright Side of Timed Opacity
Étienne André, Sarah Dépernet, Engel Lefaucheux
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 2…
The 2-Dimensional Constraint Loop Problem is Decidable
Quentin Guilmant, Engel Lefaucheux, Joël Ouaknine +1
A linear constraint loop is specified by a system of linear inequalities that define the relation between the values of the program variables before and after a single execution of…
Expiring opacity problems in parametric timed automata
Étienne André, Engel Lefaucheux, Dylan Marinho
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 i…
Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed Automata
Étienne André, Engel Lefaucheux, Didier Lime +2
Timing information leakage occurs whenever an attacker successfully deduces confidential internal information by observing some timed information such as events with timestamps. Ti…
strategFTO: Untimed control for timed opacity
Étienne André, Shapagat Bolat, Engel Lefaucheux +1
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…
Model Checking Linear Dynamical Systems under Floating-point Rounding
Engel Lefaucheux, Joël Ouaknine, David Purser +1
We consider linear dynamical systems under floating-point rounding. In these systems, a matrix is repeatedly applied to a vector, but the numbers are rounded into floating-point re…
Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set
Julian D'Costa, Engel Lefaucheux, Eike Neumann +2
We study the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets. We establish a uniform upper bound on the number of iterations it takes for…
The boundedness and zero isolation problems for weighted automata over nonnegative rationals
Wojciech Czerwiński, Engel Lefaucheux, Filip Mazowiecki +2
We consider linear cost-register automata (equivalent to weighted automata) over the semiring of nonnegative rationals, which generalise probabilistic automata. The two problems of…
On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets
Julian D'Costa, Engel Lefaucheux, Eike Neumann +2
We study the computational complexity of the Escape Problem for discrete-time linear dynamical systems over compact semialgebraic sets, or equivalently the Termination Problem for…
Porous Invariants
Engel Lefaucheux, Joël Ouaknine, David Purser +1
We introduce the notion of porous invariants for multipath (or branching/nondeterministic) affine loops over the integers; these invariants are not necessarily convex, and can in f…
The Orbit Problem for Parametric Linear Dynamical Systems
Christel Baier, Florian Funke, Simon Jantsch +7
We study a parametric version of the Kannan-Lipton Orbit Problem for linear dynamical systems. We show decidability in the case of one parameter and Skolem-hardness with two or mor…
Reachability in Dynamical Systems with Rounding
Christel Baier, Florian Funke, Simon Jantsch +6
We consider reachability in dynamical systems with discrete linear updates, but with fixed digital precision, i.e., such that values of the system are rounded at each step. Given a…
One-Clock Priced Timed Games with Negative Weights
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +2
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modelling the cost of spending time in a st…
On Positivity and Minimality for Second-Order Holonomic Sequences
George Kenison, Oleksiy Klurman, Engel Lefaucheux +5
An infinite sequence of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with p…
How Fast Can You Escape a Compact Polytope?
Julian D'Costa, Engel Lefaucheux, Joël Ouaknine +1
The Continuous Polytope Escape Problem (CPEP) asks whether every trajectory of a linear differential equation initialised within a convex polytope eventually escapes the polytope.…
On the Monniaux Problem in Abstract Interpretation
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann +3
The Monniaux Problem in abstract interpretation asks, roughly speaking, whether the following question is decidable: given a program , a safety (\emph{e.g.}, non-reachability) s…
Simple Priced Timed Games Are Not That Simple
Thomas Brihaye, Gilles Geeraerts, Axel Haddad +2
Priced timed games are two-player zero-sum games played on priced timed automata (whose locations and transitions are labeled by weights modeling the costs of spending time in a st…