Nathalie Bertrand

ORCID

Publication Activity (10 Years)

Years Active: 2003-2024
Publications (10 Years): 50

Top Venues

CoRR

CONCUR

FSTTCS

Log. Methods Comput. Sci.

École normale supérieure de Cachan, France (PHD)

Education History

École normale supérieure de Cachan, France

PHD

Publications

Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin, Bernhard Scholz, Pavle Subotic
Reusable Formal Verification of DAG-based Consensus Protocols. CoRR (2024)
Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
Games on Graphs. CoRR (2023)
Nathalie Bertrand, Hugo Francon, Nicolas Markey
Synchronizing words under LTL constraints. Inf. Process. Lett. 182 (2023)
Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder
Brief Announcement: Holistic Verification of Blockchain Consensus. PODC (2022)
Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger
Parameterized Safety Verification of Round-Based Shared-Memory Systems. ICALP (2022)
Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger
Parameterized safety verification of round-based shared-memory systems. CoRR (2022)
Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder
Holistic Verification of Blockchain Consensus. CoRR (2022)
Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder
Holistic Verification of Blockchain Consensus. DISC (2022)
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
Semilinear Representations for Series-Parallel Atomic Congestion Games. FSTTCS (2022)
Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Correction to: Verification of randomized consensus algorithms under round-rigid adversaries. Int. J. Softw. Tools Technol. Transf. 23 (5) (2021)
Nathalie Bertrand, Bastien Thomas, Josef Widder
Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. CONCUR (2021)
Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Verification of randomized consensus algorithms under round-rigid adversaries. Int. J. Softw. Tools Technol. Transf. 23 (5) (2021)
Luca Aceto, Nathalie Bertrand, Nobuko Yoshida
Interviews with the 2021 CONCUR Test-of-Time Award Recipients. Bull. EATCS 135 (2021)
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar
Reconfiguration and Message Losses in Parameterized Broadcast Networks. Log. Methods Comput. Sci. 17 (1) (2021)
Nathalie Bertrand, Marijana Lazic, Josef Widder
A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries. VMCAI (2021)
Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida
CONCUR Test-Of-Time Award 2021 (Invited Paper). CONCUR (2021)
Nathalie Bertrand
Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk). OPODIS (2021)
Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. CONCUR (2021)
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux
Diagnosis and Degradation Control for Probabilistic Systems. Discret. Event Dyn. Syst. 30 (4) (2020)
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
Dynamic network congestion games. CoRR (2020)
Nathalie Bertrand
Concurrent Games with Arbitrarily Many Players (Invited Talk). MFCS (2020)
Nathalie Bertrand
Model checking randomized distributed algorithms. ACM SIGLOG News 7 (1) (2020)
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar
Synthesizing safe coalition strategies. CoRR (2020)
Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur
Dynamic Network Congestion Games. FSTTCS (2020)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier
Taming denumerable Markov decision processes with decisiveness. CoRR (2020)
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar
Synthesizing Safe Coalition Strategies. FSTTCS (2020)
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CoRR (2019)
Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. CONCUR (2019)
Luca Bortolussi, Nathalie Bertrand
Introduction to the Special Issue on Qest 2017. ACM Trans. Model. Comput. Simul. 29 (4) (2019)
Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Amit Godbole
Controlling a population. Log. Methods Comput. Sci. 15 (3) (2019)
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CONCUR (2019)
Christel Baier, Nathalie Bertrand, Jakob Piribauer, Ocan Sankur
Long-run Satisfaction of Path Properties. LICS (2019)
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux
A tale of two diagnoses in probabilistic systems. Inf. Comput. 269 (2019)
Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar
Concurrent Parameterized Games. FSTTCS (2019)
Nathalie Bertrand, Benjamin Bordais, Loïc Hélouët, Thomas Mari, Julie Parreaux, Ocan Sankur
Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking. RSSRail (2019)
A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey
Parameterized verification of synchronization in constrained reconfigurable broadcast networks. CoRR (2018)
Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. CoRR (2018)
A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey
Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. TACAS (2) (2018)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier
When are stochastic transition systems tameable? J. Log. Algebraic Methods Program. 99 (2018)
Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. LICS (2018)
Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Amit Godbole
Controlling a population. CoRR (2018)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier
When are Stochastic Transition Systems Tameable? CoRR (2017)
Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert
Controlling a Population. CoRR (2017)
Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert
Controlling a Population. CONCUR (2017)
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
Qualitative Determinacy and Decidability of Stochastic Games with Signals. J. ACM 64 (5) (2017)
Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica 54 (6) (2017)
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux
Diagnosis in Infinite-State Probabilistic Systems. CONCUR (2016)
Nathalie Bertrand, Luca Bortolussi, Herbert Wiklicky
Editorial: Quantitative Aspects of Programming Languages and Systems. Theor. Comput. Sci. 655 (2016)
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux
Accurate Approximate Diagnosability of Stochastic Systems. LATA (2016)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier
Analysing Decisive Stochastic Processes. ICALP (2016)
Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen
A game approach to determinize timed automata. Formal Methods Syst. Des. 46 (1) (2015)
Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier
Distributed Local Strategies in Broadcast Networks. CONCUR (2015)
Nathalie Bertrand, Eric Fabre, Stefan Haar, Serge Haddad, Loïc Hélouët
Active Diagnosis for Probabilistic Systems. FoSSaCS (2014)
Nathalie Bertrand, Thomas Brihaye, Blaise Genest
Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata. QEST (2014)
Nathalie Bertrand, Serge Haddad, Engel Lefaucheux
Foundation of Diagnosis and Predictability in Probabilistic Systems. FSTTCS (2014)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski
Stochastic Timed Automata. Log. Methods Comput. Sci. 10 (4) (2014)
Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier
Playing with Probabilities in Reconfigurable Broadcast Networks. FoSSaCS (2014)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer
Emptiness and Universality Problems in Timed Automata with Positive Frequency. CoRR (2013)
Paolo Ballarini, Nathalie Bertrand, András Horváth, Marco Paolieri, Enrico Vicario
Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes. QEST (2013)
Nathalie Bertrand, Paulin Fournier
Parameterized Verification of Many Identical Probabilistic Timed Processes. FSTTCS (2013)
S. Akshay, Nathalie Bertrand, Serge Haddad, Loïc Hélouët
The Steady-State Control Problem for Markov Decision Processes. QEST (2013)
Nathalie Bertrand, Philippe Schnoebelen
Computable fixpoints in well-structured symbolic model checking. Formal Methods Syst. Des. 43 (2) (2013)
Nathalie Bertrand, Philippe Schnoebelen
Solving Stochastic Büchi Games on Infinite Decisive Arenas. QAPL (2013)
Nathalie Bertrand, John Fearnley, Sven Schewe
Bounded Satisfiability for PCTL. CSL (2012)
Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen
Off-line test selection with test purposes for non-deterministic timed automata Log. Methods Comput. Sci. 8 (4) (2012)
Nathalie Bertrand, Sven Schewe
Playing Optimally on Timed Automata with Random Delays. FORMATS (2012)
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet
Modal event-clock specifications for timed component-based design. Sci. Comput. Program. 77 (12) (2012)
Nathalie Bertrand, John Fearnley, Sven Schewe
Bounded Satisfiability for PCTL CoRR (2012)
Christel Baier, Marcus Größer, Nathalie Bertrand
Probabilistic ω-automata. J. ACM 59 (1) (2012)
Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. RTA (2012)
Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata. TACAS (2011)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer
Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) (2011)
Nathalie Bertrand, Blaise Genest
Minimal Disclosure in Partially Observable Markov Decision Processes. FSTTCS (2011)
Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen
A Game Approach to Determinize Timed Automata. FoSSaCS (2011)
Nathalie Bertrand, Christophe Morvan
Probabilistic regular graphs INFINITY (2010)
Christel Baier, Nathalie Bertrand, Marcus Größer
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability DCFS (2009)
Christel Baier, Nathalie Bertrand, Marcus Größer
The Effect of Tossing Coins in Omega-Automata. CONCUR (2009)
Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet
Refinement and Consistency of Timed Modal Specifications. LATA (2009)
Christel Baier, Nathalie Bertrand, Marcus Größer
Probabilistic Acceptors for Languages over Infinite Words. SOFSEM (2009)
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS (2009)
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet
A Compositional Approach on Modal Specifications for Timed Systems. ICFEM (2009)
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye
When Are Timed Automata Determinizable? ICALP (2) (2009)
Nathalie Bertrand, Blaise Genest, Hugo Gimbert
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides CoRR (2008)
Christel Baier, Nathalie Bertrand, Marcus Größer
On Decision Problems for Probabilistic Büchi Automata. FoSSaCS (2008)
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. LICS (2008)
Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST (2008)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9 (1) (2007)
Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer
Probabilistic and Topological Semantics for Timed Automata. FSTTCS (2007)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. LPAR (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97 (2) (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems CoRR (2006)
Christel Baier, Nathalie Bertrand, Philippe Schnoebelen
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties CoRR (2005)
Nathalie Bertrand, Philippe Schnoebelen
A Short Visit to the STS Hierarchy. EXPRESS (2005)
Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen
Verification of probabilistic systems with faulty communication. Inf. Comput. 202 (2) (2005)
Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
1-identifying codes on trees. Australas. J Comb. 31 (2005)
Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein
Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25 (7) (2004)
Nathalie Bertrand, Philippe Schnoebelen
Model Checking Lossy Channels Systems Is Probably Decidable. FoSSaCS (2003)

Nathalie Bertrand.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nathalie Bertrand