Engel Lefaucheux

Orcid: 0000-0003-0875-300X

According to our database1, Engel Lefaucheux authored at least 29 papers between 2014 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Configuring Timing Parameters to Ensure Execution-Time Opacity in Timed Automata.
Proceedings of the First Workshop on Trends in Configurable Systems Analysis, 2023

Model Checking Linear Dynamical Systems under Floating-point Rounding.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2023

Expiring opacity problems in parametric timed automata.
Proceedings of the 27th International Conference on Engineering of Complex Computer Systems, 2023

2022
What's decidable about linear loops?
Proc. ACM Program. Lang., 2022

One-Clock Priced Timed Games with Negative Weights.
Log. Methods Comput. Sci., 2022

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set.
Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

The boundedness and zero isolation problems for weighted automata over nonnegative rationals.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

strategFTO: Untimed Control for Timed Opacity.
Proceedings of the 8th ACM SIGPLAN International Workshop on Formal Techniques for Safety-Critical Systems, 2022

Parameter Synthesis for Parametric Probabilistic Dynamical Systems and Prefix-Independent Specifications.
Proceedings of the 33rd International Conference on Concurrency Theory, 2022

2021
The Orbit Problem for Parametric Linear Dynamical Systems.
CoRR, 2021

Accurate Approximate Diagnosis of (Controllable) Stochastic Systems.
Proceedings of the Quantitative Evaluation of Systems - 18th International Conference, 2021

On Positivity and Minimality for Second-Order Holonomic Sequences.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Complexity of the Escape Problem for Linear Dynamical Systems over Compact Semialgebraic Sets.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

The Orbit Problem for Parametric Linear Dynamical Systems.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Porous Invariants.
Proceedings of the Computer Aided Verification - 33rd International Conference, 2021

2020
Diagnosis and Degradation Control for Probabilistic Systems.
Discret. Event Dyn. Syst., 2020

One-Clock Priced Timed Games with Arbitrary Weights.
CoRR, 2020

How Fast Can You Escape a Compact Polytope?
Proceedings of the 37th International Symposium on Theoretical Aspects of Computer Science, 2020

Reachability in Dynamical Systems with Rounding.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019
A tale of two diagnoses in probabilistic systems.
Inf. Comput., 2019

On the Monniaux Problem in Abstract Interpretation.
Proceedings of the Static Analysis - 26th International Symposium, 2019

2018
Controlling information in Probabilistic Systems. (Le contrôle de l'information dans les systèmes probabilistes).
PhD thesis, 2018

Diagnosability of repairable faults.
Discret. Event Dyn. Syst., 2018

Basis Coverability Graph for Partially Observable Petri Nets with Application to Diagnosability Analysis.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2018

2017
Probabilistic Disclosure: Maximisation vs. Minimisation.
Proceedings of the 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2017

2016
Accurate Approximate Diagnosability of Stochastic Systems.
Proceedings of the Language and Automata Theory and Applications, 2016

Diagnosis in Infinite-State Probabilistic Systems.
Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015
Simple Priced Timed Games are not That Simple.
Proceedings of the 35th IARCS Annual Conference on Foundation of Software Technology and Theoretical Computer Science, 2015

2014
Foundation of Diagnosis and Predictability in Probabilistic Systems.
Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014


  Loading...