Publications 2006-2025

• 2025
  • L. Guillou, A. Sangnier, N. Sznajder : “Wait-Only Broadcast Protocols are Easier to Verify”, 50^th International Symposium on Mathematical Foundations of Computer Science (MFCS 2025), vol. 345, Leibniz International Proceedings in Informatics (LIPIcs), Varsovie, Poland, pp. 53:1-53:17, (Schloss Dagstuhl – Leibniz-Zentrum für Informatik), (ISBN: 978-3-95977-388-1) (2025)
• 2024
  • L. Guillou, A. Sangnier, N. Sznajder : “Phase-Bounded Broadcast Networks over Topologies of Communication”, 35^th International Conference on Concurrency Theory (CONCUR 2024), vol. 311, Leibniz International Proceedings in Informatics (LIPIcs), Calgary, AL, Canada, pp. 26:1-26:16, (Schloss Dagstuhl – Leibniz-Zentrum für Informatik), (ISBN: 978-3-95977-339-3) (2024)
  • L. Guillou, A. Sangnier, N. Sznajder : “Safety Verification of Wait-Only Non-Blocking Broadcast Protocols”, Application and Theory of Petri Nets and Concurrency - 45^th International Conference, PETRI NETS 2024, Proceedings, vol. 14628, Lecture Notes in Computer Science, Geneva, Switzerland, pp. 291-311, (Springer Nature Switzerland) (2024)
  • B. Bollig, M. Lehaut, N. Sznajder : “Round- and context-bounded control of dynamic pushdown systems”, Formal Methods in System Design, vol. 62, pp. 41–78, (Springer Verlag) (2024)
• 2023
  • L. Guillou, A. Sangnier, N. Sznajder : “Safety Analysis of Parameterised Networks with Non-Blocking Rendez-Vous”, 34^th International Conference on Concurrency Theory, CONCUR 2023, vol. 279, Leibniz International Proceedings in Informatics (LIPIcs), Antwerp, Belgium, pp. 7:1-7:17, (Schloss Dagstuhl - Leibniz-Zentrum für Informatik) (2023)
• 2022
  • B. Bérard, B. Bollig, P. Bouyer, M. Függer, N. Sznajder : “Synthesis in presence of dynamic links”, Information and Computation, vol. 289 (Part B), pp. 104856, (Elsevier) (2022)
• 2021
  • Y. Amoussou‑Guenou, S. Baarir, M. Potop‑Butucaru, N. Sznajder, L. Tible, S. Tixeuil : “On the Encoding and Solving of Partial Information Games”, Networked Systems, vol. 12129, Lecture Notes in Computer Science, Marrakech, Morocco, pp. 60-76, (Springer International Publishing), (ISBN: 978-3-030-67087-0) (2021)
• 2020
  • A. Sangnier, N. Sznajder, M. Potop‑Butucaru, S. Tixeuil : “Parameterized verification of algorithms for oblivious robots on a ring”, Formal Methods in System Design, vol. 56, pp. 55-89, (Springer Verlag) (2020)
  • B. Bérard, B. Bollig, P. Bouyer, M. Függer, N. Sznajder : “Synthesis in Presence of Dynamic Links”, Proceedings of the 11^th International Symposium on Games, Automata, Logics, and Formal Verification (GandALF'20), Brussels (online), Belgium (2020)
  • N. Sznajder, B. Bérard, B. Bollig, M. Lehaut : “Parameterized Synthesis for Fragments of First-Order Logic over Data Words”, Proceedings of the 23^rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'20), vol. 12077, Lecture Notes in Computer Science, Dublin, Ireland, pp. 97-118, (Springer) (2020)
• 2019
  • M. Potop‑Butucaru, N. Sznajder, S. Tixeuil, X. Urbain : “Formal Methods for Mobile Robots”, chapter in Distributed Computing by Mobile Entities,Current Research in Moving and Computing n°11340, Theoretical Computer Science and General Issues, pp. 278-313, (Springer International Publishing), (ISBN: 978-3-030-11071-0) (2019)
• 2018
  • B. Bollig, M. Lehaut, N. Sznajder : “Round-Bounded Control of Parameterized Systems”, 16^th International Symposium on Automated Technology for Verification and Analysis (ATVA 2018), vol. 11138, Proceedings of the 16^th International Symposium on Automated Technology for Verification and Analysis (ATVA 2018), Los Angeles, California, United States, pp. 370-386, (Springer) (2018)
  • Y. Amoussou‑Guenou, S. Baarir, M. Potop‑Butucaru, N. Sznajder, L. Tible, S. Tixeuil : “On the encoding and solving partial information games”, (2018)
• 2017
  • A. Sangnier, N. Sznajder, M. Potop‑Butucaru, S. Tixeuil : “Parameterized verification of algorithms for oblivious robots on a ring”, Formal Methods in Computer Aided Design, Vienna, Austria, pp. 212-219, (IEEE) (2017)
  • A. Sangnier, N. Sznajder, M. Potop‑Butucaru, S. Tixeuil : “Parameterized Verification of Algorithms for Oblivious Robots on a Ring”, (2017)
• 2016
  • Th. Brihaye, M. Estiévenart, G. Geeraerts, H.‑M. Ho, B. Monmege, N. Sznajder : “Real-time Synthesis is Hard!”, Proceedings of the 14^th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS'16), vol. 9884, Lecture Notes in Computer Science, Québec City, Canada, pp. 105-120, (Springer) (2016)
• 2015
  • L. Millet, M. Potop‑Butucaru, N. Sznajder, S. Tixeuil : “Synthèse d’algorithmes pour robots mobiles : le cas du regroupement sur un anneau”, ALGOTEL 2015 — 17^es Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Beaune, France (2015)
  • B. Bérard, K. Chatterjee, N. Sznajder : “Probabilistic Opacity for Markov Decision Processes”, Information Processing Letters, vol. 115 (1), pp. 52-59, (Elsevier) (2015)
  • B. Bérard, P. Courtieu, L. Millet, M. Potop‑Butucaru, L. Rieg, N. Sznajder, S. Tixeuil, X. Urbain : “[Invited Paper] Formal Methods for Mobile Robots: Current Results and Open Problems”, International Journal of Informatics Society, vol. 7 (3), pp. 101-114, (Japan Informatics Society) (2015)
• 2014
  • G. Geeraerts, J.‑F. Raskin, N. Sznajder : “On regions and zones for event-clock automata”, Formal Methods in System Design, vol. 45 (3), pp. 330-380, (Springer Verlag) (2014)
  • L. Millet, M. Potop‑Butucaru, N. Sznajder, S. Tixeuil : “On the Synthesis of Mobile Robots Algorithms: the Case of Ring Gathering”, SSS 2014 - 16^th International Symposium on Stabilization, Safety and Security of Distributed Systems, vol. 8756, Lecture Notes in Computer Science, Paderborn, Germany, pp. 237-251, (Springer) (2014)
• 2013
  • P. Gastin, N. Sznajder : “Fair Synthesis for Asynchronous Distributed Systems”, ACM Transactions on Computational Logic, vol. 14 (2), pp. 9, (Association for Computing Machinery) (2013)
• 2012
  • P. Gastin, N. Sznajder : “Decidability of well-connectedness for distributed synthesis”, Information Processing Letters, vol. 112 (24), pp. 963-968, (Elsevier) (2012)
  • B. Bérard, S. Haddad, M. Sassolas, N. Sznajder : “Concurrent Games on VASS with Inhibition”, 23^rd International Conference on Concurrency Theory (CONCUR'12), vol. 7454, Lecture Notes in Computer Science, Newcastle upon Tyne, United Kingdom, pp. 39-52, (Springer) (2012)
  • N. Sznajder : “Fair Synthesis of Asynchronous Distributed Systems”, Software Synthesis (Dagstuhl Seminar 12152), vol. 2 (4), Dagstuhl, Germany, pp. 33, (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik) (2012)
• 2011
  • G. Geeraerts, J.‑F. Raskin, N. Sznajder : “Event Clock Automata : From Theory to Practice”, FORMATS 2011 - 9^th International Conference on Formal Modelling and Analysis of Timed Systems, vol. 6919, Lecture Notes in Computer Science, Aalborg, Denmark, pp. 209-224, (Springer) (2011)
  • C. Dutheillet, I. Mounier, N. Sznajder : “Distributed Control”, chapter in Models and Analysis in Distributed Systems, pp. 307-351, (Wiley), (ISBN: 9781848213142) (2011)
• 2010
  • B. Di Giampaolo, G. Geeraerts, J.‑F. Raskin, N. Sznajder : “Safraless procedures for timed specifications”, Proceedings of FORMATS'10, vol. 6246, Lecture Notes in Computer Science, K. Chatterjee, Thomas A. Henzinger (Eds.), Klosterneuburg, Austria, pp. 2-22, (Springer) (2010)
• 2009
  • P. Gastin, N. Sznajder, M. Zeitoun : “Distributed synthesis for well-connected architectures”, Formal Methods in System Design, vol. 34 (3), pp. 215-237, (Springer Verlag) (2009)
  • P. Gastin, N. Sznajder, Th. Chatain : “Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems”, Proceedings of the 35^th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM'09), vol. 5404, Mlýn, Czechia, pp. 141-152, (Springer) (2009)
  • N. Sznajder : “Synthèse de systèmes distribués ouverts”, thèse, soutenance 12/11/2009, direction de recherche Gastin,Paul, co-encadrement : Raskin Jean-François, Walukiewicz Igor (2009)
• 2007
  • A. Abate, Y. Bai, N. Sznajder, C. Talcott, A. Tiwari : “Quantitative and Probabilisitic Modeling in Pathway Logic”, Proceedings of BIBE'07, Boston, Massachussetts, USA, pp. 922-929, (IEEE Computer Society Press) (2007)
• 2006
  • P. Gastin, N. Sznajder, M. Zeitoun : “Distributed synthesis for well-connected architectures”, Proc. of the 26^th Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 4337, Lecture Notes in Computer Science, Kolkata, India, pp. 321-332, (Springer) (2006)