Research¶
Follow me on 
Google Scholar to be notified of my latest publications.
Conference Papers¶
- Antoine Legat and Julien M. Hendrickx, “Path-Based Conditions for Local Network Identifiability–Full Version”, to be published in Proceedings of the 60th IEEE Conference on Decision and Control (CDC 2021), Austin (Texas, USA), December 2021. [PDF, slides, video]
- Antoine Legat and Julien M. Hendrickx, “Local Network Identifiability with Partial Excitation and Measurement”, Proceedings of the 59th IEEE Conference on Decision and Control (CDC 2020); Jeju Island (Republic of Korea), December 2020. [PDF, slides, video]
Talks¶
- Conference presentation, “Local Network Identifiability: Path Conditions”, at the 42nd Benelux Meeting on Systems and Control (2023), held in Elspeet (The Netherlands) in March 2023. [abstract, slides]
- Conference poster presentation, “Identifiability in Networked Systems: Path-Based Conditions”, at the 2022 Workshop of the European Research Network on System Identification (ERNSI), held in Leuven (Belgium) in September 2022. [teaser, poster]
- Conference presentation, “Algebraic and Path-Based Conditions for Local Network Identifiability”, at the 25th International Symposium on Mathematical Theory of Networks and Systems (MTNS) 2022, held in Bayreuth (Germany) in September 2022. [abstract, slides]
- Conference presentation, “Necessary Graph Condition for Local Network Identifiability”, at the European Research Network on System Identification Workshop 2021 (ERNSI), held online in September 2021. [abstract, slides]
- Conference presentation, “Graph-Theoretical Condition for Local Network Identifiability”, at the 40th Benelux Meeting on Systems and Control (2021), held in Rotterdam (The Netherlands) in June 2021. [abstract, slides]
- Conference presentation, “Local Dynamics Identification via a Graph-Theoretical Approach”, at the 39th Benelux Meeting on Systems and Control (2020), held in Elspeet (The Netherlands) in March 2020. [abstract, slides]
Toolbox¶
- We have implemented a toolbox that computes the local and decoupled identifiability of each edge for any network given. The code presents the results graphically: it displays the network graph and highlights the (non)-identifiable edges. Along this toolbox, we have added a code to check the potential equivalence of decoupled and local identifiability. [code]