Publications of Nathalie Bertrand

Load the BibTeX file

Books

  1. N. Bertrand, L. Bortolussi. Proceedings of the 14th International Conference on Quantitative Evaluation of Systems (QEST 2017), Berlin, Germany, September 5-7, 2017. France, 2017. details
  2. N. Bertrand, M. Tribastone. Proceedings of the Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL'15). France, 2015. details doi

Academic Journals

  1. Nathalie Bertrand, Hugo Francon, Nicolas Markey. Synchronizing words under LTL constraints. Information Processing Letters, 182, August 2023. details doi pdf
  2. N. Bertrand, I. Konnov, M. Lazic, J. Widder. Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries. International Journal on Software Tools for Technology Transfer, 23:797-821, October 2021. details doi pdf
  3. Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Reconfiguration and Message Losses in Parameterized Broadcast Networks. Logical Methods in Computer Science, 17(1):1-18, March 2021. details
  4. Nathalie Bertrand, Serge Haddad, Engel Lefaucheux. Diagnosis and Degradation Control for Probabilistic Systems. Discrete Event Dynamic Systems, 30(4):695-723, December 2020. details doi
  5. Nathalie Bertrand. Model checking randomized distributed algorithms. ACM SIGLOG News, 7(1):35-45, February 2020. details doi
  6. N. Bertrand, M. Dewaskar, B. Genest, H. Gimbert, A. Godbole. Controlling a population. Logical Methods in Computer Science, 15(3):1-30, 2019. details doi pdf
  7. N. Bertrand, S. Haddad, E. Lefaucheux. A Tale of Two Diagnoses in Probabilistic Systems. Journal of Information and Computation, 269:1-33, December 2019. details doi pdf
  8. N. Bertrand, P. Bouyer, T. Brihaye, P. Carlier. When are stochastic transition systems tameable?. Journal of Logical and Algebraic Methods in Programming, 99:41-96, 2018. details doi
  9. A. Bohy, V. Bruyère, J-F Raskin, N Bertrand. Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica, 54(6):545-587, September 2017. details doi
  10. N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. Formal Methods in System Design, February 2015. details doi download
  11. N. Bertrand, Ph. Schnoebelen. Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design, 43(2):223-267, October 2013. details doi pdf
  12. N. Bertrand, A. Legay, S. Pinchinat, Raclet JB.. Modal event-clock specifications for timed component-based design. Science of Computer Programming, 77:1212-1234, 2012. details doi pdf
  13. N. Bertrand, T. Jéron, A. Stainer, M. Krichen. Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata. Logical Methods in Computer Science, 8(4), March 2012. details doi pdf
  14. C. Baier, M. Grösser, N. Bertrand. Probabilistic w-automata. Journal of the ACM, 59(1), February 2012. details doi
  15. C. Baier, N. Bertrand, Ph. Schnoebelen. Verifying nondeterministic probabilistic channel systems against omega-regular linear-time properties. ACM Transactions on Computational Logic, 9(1), 2007. details doi pdf
  16. C. Baier, N. Bertrand, Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58-63, January 2006. details doi pdf
  17. P.A. Abdulla, N. Bertrand, A. Rabinovich, Ph. Schnoebelen. Verification of Probabilistic Systems with Faulty Communication. Information and Computation, 202(2):141-165, November 2005. details download pdf
  18. N. Bertrand, I. Charon, O. Hudry, A. Lobstein. 1-Identifying Codes on Trees. Australasian Journal of Combinatorics, 31:21-35, February 2005. details

Book Chapters

  1. N. Bertrand, S. Haddad. Contrôle, probabilités et observation partielle. In Informatique Mathématique. Une photographie en 2015, pp. 177-227, CNRS Edition, 2015. details

International Conferences

  1. N. Bertrand, N. Markey, S. Sadhukhan, O. Sankur. Semilinear Representations for Series-Parallel Atomic Congestion Games. In 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2022), Chennai, France, December 2022. details doi
  2. N. Bertrand, V. Gramoli, I. Konnov, M. Lazic, P. Tholoniat, J. Widder. Holistic Verification of Blockchain Consensus. In DISC 2022 - 36th International Symposium on Distributed Computing, Augusta, United States, October 2022. details doi pdf
  3. N. Bertrand, V. Gramoli, I. Konnov, M. Lazic, P. Tholoniat, J. Widder. Brief Announcement: Holistic Verification of Blockchain Consensus. In PODC 2022 - The 41st ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 2022. details doi pdf
  4. N. Bertrand, N. Markey, O. Sankur, N. Waldburger. Parameterized safety verification of round-based shared-memory systems. In ICALP 2022, Paris, France, July 2022. details doi
  5. N. Bertrand, B. Thomas, J. Widder. Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. In Concur 2021 - International Conference on Concurrency Theory, Pages 1-17, Paris, France, August 2021. details doi pdf
  6. N. Bertrand, L. de Alfaro, R. J Van Glabbeek, C. Palamidessi, N. Yoshida. CONCUR Test-Of-Time Award 2021. In Concur 2021 - International Conference on Concurrency Theory, Pages 1-3, Paris, France, August 2021. details pdf
  7. Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur. Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. In CONCUR 2021 - 32nd International Conference on Concurrency Theory, Pages 1-18, Paris, France, August 2021. details doi pdf
  8. N. Bertrand, M. Lazic, J. Widder. A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries. In 22nd International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'21), Pages 219-239, Copenhagen, Denmark, January 2021. details pdf
  9. N. Bertrand, N. Markey, S. Sadhukhan, O. Sankur. Dynamic network congestion games. In 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2020), Goa, India, December 2020. details pdf
  10. Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar. Synthesizing safe coalition strategies. In FSTTCS'20, 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, on line, India, December 2020. details pdf
  11. N. Bertrand. Concurrent Games with Arbitrarily Many Players. In 45th International Symposium on Mathematical Foundations of Computer Science (MFCS 2020), Prag, France, August 2020. details pdf
  12. N. Bertrand, P. Bouyer, A. Majumdar. Concurrent parameterized games. In FSTTCS 2019 - 39th IARCS Annual Conference on. Foundations of Software Technology and Theoretical Computer Science, Pages 1-15, Bombay, India, December 2019. details pdf
  13. N. Bertrand, P. Bouyer, A. Majumdar. Reconfiguration and message losses in parameterized broadcast networks. In CONCUR 2019 - 30th International Conference on Concurrency Theory, Pages 1-15, Amsterdam, Netherlands, August 2019. details doi pdf
  14. N. Bertrand, I. Konnov, M. Lazic, J. Widder. Verification of Randomized Consensus Algorithms under Round-Rigid Adversaries. In CONCUR 2019 - 30th International Conference on Concurrency Theory, Pages 1-16, Amsterdam, Netherlands, August 2019. details pdf
  15. N. Bertrand, B. Bordais, L. Hélouet, T. Mari, J. Parreaux, O. Sankur. Performance Evaluation of Metro Regulations Using Probabilistic Model-checking. In RSSRail 2019 - International conference on reliability, safety and security of railway systems: modelling, analysis, verification and certification, LNCS, Pages 1-22, Lille, France, June 2019. details pdf
  16. Ch. Baier, N. Bertrand, J. Piribauer, O. Sankur. Long-run Satisfaction of Path Properties. In LICS 2019 - 34th Annual ACM/IEEE Symposium on Logic in Computer Science, Pages 1-31, Vancouver, Canada, June 2019. details doi pdf
  17. C. Baier, N. Bertrand, C. Dubslaff, D. Gburek, O. Sankur. Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. In LICS '18 - 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, Pages 86-94, Oxford, United Kingdom, July 2018. details doi
  18. A.R. Balasubramanian, N. Bertrand, N. Markey. Parameterized verification of synchronization in constrained reconfigurable broadcast networks. In TACAS 2018 - International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Pages 38-54, Thessaloniki, Greece, April 2018. details doi pdf
  19. N. Bertrand, S. Haddad, E. Lefaucheux. Diagnostic et contrôle de la dégradation des systèmes probabilistes. In MSR 2017 - Modélisation des Systèmes Réactifs, Marseille, France, November 2017. details pdf
  20. N. Bertrand, M. Dewaskar, B. Genest, H. Gimbert. Controlling a Population. In CONCUR 2017 - 28th International Conference on Concurrency Theory, Pages 1-23, Berlin, Germany, September 2017. details pdf
  21. N. Bertrand, S. Haddad, E. Lefaucheux. Diagnosis in Infinite-State Probabilistic Systems . In 27th International Conference on Concurrency Theory (Concur 2016), 27th International Conference on Concurrency Theory (Concur 2016), Québec city, Canada, August 2016. details doi pdf
  22. N. Bertrand, S. Haddad, E. Lefaucheux. Accurate approximate diagnosability of stochastic systems. In 10th International Conference on Language and Automata Theory and Applications, Prague, Czech Republic, March 2016. details pdf
  23. N. Bertrand, P. Fournier, A. Sangnier. Distributed local strategies in broadcast networks. In 26th International Conference on Concurrency Theory (CONCUR 2015), Madrid, Spain, September 2015. details doi
  24. N. Bertrand, S. Haddad, E. Lefaucheux. Foundation of Diagnosis and Predictability in Probabilistic Systems. In FSTTCS'14, New Delhi, India, December 2014. details pdf
  25. N. Bertrand, Th. Brihaye, B. Genest. Deciding the value 1 problem for reachability in 1-clock decision stochastic timed automata. In proceedings of the 11th International Conference on Quantitative Evaluation of Systems (QEST'14), Springer (ed.), LNCS, Volume 8657, Pages 313-328, Firenze, Italy, September 2014. details doi pdf
  26. N. Bertrand, E, Fabre, S. Haar, S. Haddad, L. Hélouet. Active diagnosis for probabilistic systems. In 17th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS'14, Springer (ed.), LNCS, Volume 8412, Pages 29-42, Grenoble, France, April 2014. details download
  27. N. Bertrand, P. Fournier, A. Sangnier. Playing with probabilities in reconfigurable broadcast networks. In 17th International Conference on Foundations of Software Science and Computation Structures, FoSSaCS'14, Springer (ed.), LNCS, Volume 8412, Pages 134-148, Grenoble, France, April 2014. details doi
  28. N. Bertrand, P. Fournier. Parameterized verification of many identical probabilistic timed processes. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS'13, LIPIcs, Volume 24, Pages 501-513, IIT Guwahati, India, December 2013. details pdf
  29. S Akshay, N. Bertrand, Haddad S, L. Hélouet. The steady-state control problem for Markov decision processes. In 10th International Conference on Quantitative Evaluation of SysTems (QEST'13), LNCS, Volume 8054, Pages 390-304, Buenos Aires, Argentina, August 2013. details pdf
  30. P. Ballarini, N. Bertrand, A. Horvath, M. Paolieri, E. Vicario. Transient Analysis of Networks of Stochastic Timed Automata using Stochastic State Classes. In 10th International Conference on Quantitative Evaluation of SysTems (QEST'13), LNCS, Volume 8054, Pages 355-371, Buenos Aires, Argentina, August 2013. details pdf
  31. N. Bertrand, Ph. Schnoebelen. Solving Stochastic Büchi Games on Infinite Arenas with a Finite Attractor. In 11th International Workshop on Quantitative Aspects of Programming Languages and Systems (QAPL'13), Open Publishing Association (ed.), Volume 117, Roma, Italia, March 2013. details pdf
  32. N. Bertrand, J. Fearnley, S. Schewe. Bounded Satisfiability for PCTL. In proceedings of the 21st EACSL Annual Conferences on Computer Science Logic (CSL'12), LIPIcs, Pages 92-106, Fontainebleau, France, September 2012. details doi pdf
  33. N. Bertrand, S. Schewe. Playing Optimally on Timed Automata with Random Delays. In proceedings of the 10th International Conference on Formal Modeling and Analysis of Timed Systems (Formats'12), LNCS, Volume 7595, Pages 43-58, London, UK, September 2012. details doi pdf
  34. N. Bertrand, G. Delzanno, B. König, A. Sangnier, J. Stückrath. On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. In 23rd International Conference on Rewriting Techniques and Applications, LIPIcs 15, Pages 101-116, Nagoya, Japan, May 2012. details pdf
  35. N. Bertrand, B. Genest. Minimal Disclosure in Partially Observable Markov Decision Processes . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, Pages 411-422, Bombay, India, 2011. details doi download
  36. N. Bertrand, P Bouyer, Th. Brihaye, A. Stainer. Emptiness and Universality Problems in Timed Automata with Positive Frequency. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11), LNCS, Volume 6756, Pages 246-257, Zürich, Switzerland, July 2011. details doi pdf
  37. N. Bertrand, T. Jéron, A. Stainer, M. Krichen. Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata. In 17th International Conference on Tools and Algorithms for the Construction And Analysis of Systems (TACAS), LNCS, Volume 6605, Pages 96-111, Saarbrücken, Germany, April 2011. details doi pdf
  38. N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. In 14th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), LNCS, Volume 6604, Pages 245-259, Saarbrücken, Germany, April 2011. details doi pdf
  39. N. Bertrand, C. Morvan. Probabilistic Regular Graphs. In Infinity, EPTCS, Volume 39, Pages 77-90, Singapore, September 2010. details doi pdf
  40. C. Baier, N. Bertrand, M. Grosser. Probabilistic Acceptors for Languages over Infinite Words. In 35th Conference on Current Trends in Theory and Practice of Computer Science, LNCS, Volume 5404, Pages 19-33, Spindleruv Mlyn, Czech, 2009. details doi pdf
  41. N. Bertrand, A. Legay, S. Pinchinat, J-P. Raclet. A Compositional Approach on Modal Specifications for Timed Systems. In Proceedings of the 11th International Conference on Formal Engineering Methods (ICFEM'09), LNCS, Volume 5885, Pages 679-697, Rio de Janeiro, Brazil, December 2009. details doi pdf
  42. N. Bertrand, B. Genest, Gimbert. H.. Qualitative Determinacy and Decidability of Stochastic Games with Signals. In 24th Annual IEEE Symposium on Logic in Computer Science (LICS'09), Pages 319-328, Los Angeles, CA, USA, August 2009. details doi pdf
  43. C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye. When are timed automata determinizable?. In 36th International Colloquium on Automata, Languages and Programming (ICALP'09), LNCS, Volume 5556, Pages 43-54, Rhodes, Greece, July 2009. details doi pdf
  44. N. Bertrand, S. Pinchinat, J.B. Raclet. Refinement and Consistency of Timed Modal Specifications. In Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA'09), LNCS, Volume 5457, Pages 152-163, Tarragona, Spain, April 2009. details doi pdf
  45. N. Bertrand, P. Bouyer, Th. Brihaye, N. Markey. Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. In Proceedings of the 5th International Conference on the Quantitative Evaluation of SysTems (QEST'08), Pages 55-64, Saint Malo, France, September 2008. details doi pdf
  46. Ch. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, M. Groesser. Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. In Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS'08), Pages 217-226, Pittsburgh, PA, USA, June 2008. details doi pdf
  47. Ch. Baier, N. Bertrand, M. Groesser. On Decision Problems for Probabilistic Büchi Automata. In Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), LNCS, Volume 4962, Pages 287-301, Budapest, Hungary, March 2008. details doi pdf
  48. C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, M. Groesser. Probabilistic and Topological Semantics for Timed Automata. In Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), V. Arvind, Sanjiva Prasad (eds.), Lecture Notes in Computer Science, Volume 4855, Pages 1529-3785, New Delhi, India, December 2007. details doi pdf
  49. C. Baier, N. Bertrand, Ph. Schnoebelen. Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness. In Proceedings of 26th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'06), Elie Najm, Jean-Francois Pradat-Peyre, Véronique Vigui\' Donzeau-Gouge (eds.), Lecture Notes in Computer Science, Volume 4229, Pages 212-227, Paris, France, September 2006. details doi pdf
  50. N. Bertrand, Ph. Schnoebelen. A short visit to the STS hierarchy. In Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS'05), Jos Baeten, Iain Phillips (eds.), Electronic Notes in Theoretical Computer Science, Volume 154, Pages 59-69, San Francisco, CA, USA, July 2006. details doi pdf
  51. N. Bertrand, Ph. Schnoebelen. Verifying Nondeterministic Channel Systems With Probabilistic Message Losses. In Proceedings of the 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS'04), Ramesh Bharadwaj (ed.), Barcelona, Spain, April 2004. details pdf
  52. N. Bertrand, Ph. Schnoebelen. Model Checking Lossy Channels Systems Is Probably Decidable. In Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), Andrew D. Gordon (ed.), Lecture Notes in Computer Science, Volume 2620, Pages 120-135, Warsaw, Poland, April 2003. details pdf

Research Reports

  1. Nathalie Bertrand, Serge Haddad, Engel Lefaucheux. Diagnosis in Infinite-State Probabilistic Systems (long version). Research Report Inria Rennes ; LSV, ENS Cachan, June 2016. details pdf
  2. N. Bertrand, P. Fournier, A. Sangnier. Distributed local strategies in broadcast networks. Research Report Inria Rennes, July 2015. details download
  3. Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen. Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata. Research Report INRIA, No 7501, January 2011. details pdf
  4. N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. Research Report INRIA, No 7381, October 2010. details pdf
  5. C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, M. Grosser. A Probabilistic Semantics for Timed Automata. Research Report No LSV-08-13 Laboratoire Spécification et Vérification, ENS Cachan, France, April 2008. details pdf

Misc

  1. Ch. Baier, N. Bertrand, M. Grösser. The Effect of Tossing Coins in Omega-Automata. Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09), pp. 15-29, 2009. details

Thesis

  1. N. Bertrand. Contributions to the verification and control of timed and probabilistic models. Habilitation à diriger des recherches Rennes 1, November 2015. details download
  2. N. Bertrand. Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones et techniques de vérification automatique. PhD Thesis Laboratoire Spécification et Vérification, ENS Cachan, France, September 2006. details pdf

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
This page is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic