Chana Weil-Kennedy

About Me

I am currently doing a PostDoc in Pierre Ganty's group at the IMDEA Software Institute.

I am interested in verification, language theory, distributed computation and Petri nets, and more generally in mathematical reasoning in a computer science setting. You can find a list of my publications on dblp, Google Scholar.

Past

I completed my Ph.D. in 2023 under the supervision of Javier Esparza at the Technical University of Munich (TUM), in the Chair for Foundations of Software Reliability and Theoretical Computer Science. I worked on parameterized verification of distributed systems, Petri net reachability and population protocols in the context of the ERC-supported project PaVeS.

I obtained my Master’s degree in Computer Science from the École Normale Supérieure Paris-Saclay (formerly ENS Cachan) in 2018. I earned a Bachelor’s degree in Fundamental and Applied Mathematics from the Université Paris-Sud (formerly Université d’Orsay). More information on my academic background can be found in my curriculum vitae.

Publications

  1. S. van Bergerem, R. Guttenberg, S. Kiefer, C. Mascle, N. Waldburger, C. Weil-Kennedy. Verification of Population Protocols with Unordered Data. ICALP 2024. (arXiv)

  2. K. Doveri, P. Ganty, C. Weil-Kennedy. A Uniform Framework for Language Inclusion Problems. In Taming the Infinities of Concurrency: Essays Dedicated to Javier Esparza on the Occasion of His 60th Birthday, LNCS volume 14660, 2024.

  3. C. Weil-Kennedy. Observation Petri Nets. Doctoral thesis, published in May 2023.

  4. A. R. Balasubramanian, L. Guillou, C. Weil-Kennedy. Parameterized Analysis of Reconfigurable Broadcast Networks. FoSSaCS 2022. (arXiv) Erratum

  5. A. R. Balasubramanian, C. Weil-Kennedy. Reconfigurable Broadcast Networks and Asynchronous Shared-Memory Systems are Equivalent. GandALF 2021. (arXiv)

  6. M. Raskin, C. Weil-Kennedy. Efficient Restrictions of Immediate Observation Petri Nets. Reachability Problems 2020. (arXiv)

  7. M. Raskin, C. Weil-Kennedy, J. Esparza. Flatness and Complexity of Immediate Observation Petri Nets. CONCUR 2020. (arXiv)

  8. J. Esparza, S. Jaax, M. Raskin, C. Weil-Kennedy. The Complexity of Verifying Population Protocols. Distributed Computing Journal. (arXiv)

  9. J. Esparza, M. Raskin, C. Weil-Kennedy. Parameterized Analysis of Immediate Observation Petri Nets. Petri Nets 2019. (arXiv) Received the Best Paper Award.

  10. J. Esparza, P. Ganty, R. Majumdar, C. Weil-Kennedy. Verification of Immediate Observation Population Protocols. CONCUR 2018. (arXiv)

Teaching

I was a tutor for the following lectures at TUM.