Nathalie Bertrand

According to our database, Nathalie Bertrand authored at least 82 papers between 2003 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Reusable Formal Verification of DAG-based Consensus Protocols.

Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin, Bernhard Scholz, Pavle Subotic

CoRR, 2024

2023

Synchronizing words under LTL constraints.

Nathalie Bertrand, Hugo Francon, Nicolas Markey

Inf. Process. Lett., August, 2023

Games on Graphs.

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

CoRR, 2023

2022

Holistic Verification of Blockchain Consensus.

Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Brief Announcement: Holistic Verification of Blockchain Consensus.

Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder

Proceedings of the PODC '22: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25, 2022

Parameterized Safety Verification of Round-Based Shared-Memory Systems.

Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger

Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

Semilinear Representations for Series-Parallel Atomic Congestion Games.

Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

Correction to: Verification of randomized consensus algorithms under round-rigid adversaries.

Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder

Int. J. Softw. Tools Technol. Transf., 2021

Verification of randomized consensus algorithms under round-rigid adversaries.

Nathalie Bertrand, Igor Konnov, Marijana Lazic, Josef Widder

Int. J. Softw. Tools Technol. Transf., 2021

Reconfiguration and Message Losses in Parameterized Broadcast Networks.

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar

Log. Methods Comput. Sci., 2021

Interviews with the 2021 CONCUR Test-of-Time Award Recipients.

Luca Aceto, Nathalie Bertrand, Nobuko Yoshida

Bull. EATCS, 2021

A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries.

Nathalie Bertrand, Marijana Lazic, Josef Widder

Proceedings of the Verification, Model Checking, and Abstract Interpretation, 2021

Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk).

Nathalie Bertrand

Proceedings of the 25th International Conference on Principles of Distributed Systems, 2021

Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking.

Jakob Piribauer, Christel Baier, Nathalie Bertrand, Ocan Sankur

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms.

Nathalie Bertrand, Bastien Thomas, Josef Widder

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

CONCUR Test-Of-Time Award 2021 (Invited Paper).

Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Model checking randomized distributed algorithms.

Nathalie Bertrand

ACM SIGLOG News, 2020

Diagnosis and Degradation Control for Probabilistic Systems.

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux

Discret. Event Dyn. Syst., 2020

Taming denumerable Markov decision processes with decisiveness.

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier

CoRR, 2020

Concurrent Games with Arbitrarily Many Players (Invited Talk).

Nathalie Bertrand

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Dynamic Network Congestion Games.

Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Synthesizing Safe Coalition Strategies.

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

2019

Introduction to the Special Issue on Qest 2017.

Luca Bortolussi, Nathalie Bertrand

ACM Trans. Model. Comput. Simul., 2019

Controlling a population.

Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Amit Godbole

Log. Methods Comput. Sci., 2019

A tale of two diagnoses in probabilistic systems.

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux

Inf. Comput., 2019

Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking.

Nathalie Bertrand, Benjamin Bordais, Loïc Hélouët, Thomas Mari, Julie Parreaux, Ocan Sankur

Proceedings of the Reliability, Safety, and Security of Railway Systems. Modelling, Analysis, Verification, and Certification, 2019

Long-run Satisfaction of Path Properties.

Christel Baier, Nathalie Bertrand, Jakob Piribauer, Ocan Sankur

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

Concurrent Parameterized Games.

Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar

Proceedings of the 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2019

2018

When are stochastic transition systems tameable?

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier

J. Log. Algebraic Methods Program., 2018

Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks.

A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2018

Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes.

Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur

Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

2017

Qualitative Determinacy and Decidability of Stochastic Games with Signals.

Nathalie Bertrand, Blaise Genest, Hugo Gimbert

J. ACM, 2017

Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes.

Aaron Bohy, Véronique Bruyère, Jean-François Raskin, Nathalie Bertrand

Acta Informatica, 2017

Controlling a Population.

Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert

Proceedings of the 28th International Conference on Concurrency Theory, 2017

2016

Editorial: Quantitative Aspects of Programming Languages and Systems.

Nathalie Bertrand, Luca Bortolussi, Herbert Wiklicky

Theor. Comput. Sci., 2016

Accurate Approximate Diagnosability of Stochastic Systems.

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux

Proceedings of the Language and Automata Theory and Applications, 2016

Analysing Decisive Stochastic Processes.

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Diagnosis in Infinite-State Probabilistic Systems.

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux

Proceedings of the 27th International Conference on Concurrency Theory, 2016

2015

A game approach to determinize timed automata.

Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen

Formal Methods Syst. Des., 2015

Distributed Local Strategies in Broadcast Networks.

Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier

Proceedings of the 26th International Conference on Concurrency Theory, 2015

Contributions to the verification and control of timed and probabilistic models : Mémoire d'habilitation à diriger des recherches.

Nathalie Bertrand

, 2015

2014

Stochastic Timed Automata.

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski

Log. Methods Comput. Sci., 2014

Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata.

Nathalie Bertrand, Thomas Brihaye, Blaise Genest

Proceedings of the Quantitative Evaluation of Systems - 11th International Conference, 2014

Foundation of Diagnosis and Predictability in Probabilistic Systems.

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

Playing with Probabilities in Reconfigurable Broadcast Networks.

Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier

Proceedings of the Foundations of Software Science and Computation Structures, 2014

Active Diagnosis for Probabilistic Systems.

Nathalie Bertrand, Eric Fabre, Stefan Haar, Serge Haddad, Loïc Hélouët

Proceedings of the Foundations of Software Science and Computation Structures, 2014

2013

Computable fixpoints in well-structured symbolic model checking.

Nathalie Bertrand, Philippe Schnoebelen

Formal Methods Syst. Des., 2013

Solving Stochastic Büchi Games on Infinite Decisive Arenas.

Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Proceedings 11th International Workshop on Quantitative Aspects of Programming Languages and Systems, 2013

Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes.

Paolo Ballarini, Nathalie Bertrand, András Horváth, Marco Paolieri, Enrico Vicario

Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

The Steady-State Control Problem for Markov Decision Processes.

S. Akshay, Nathalie Bertrand, Serge Haddad, Loïc Hélouët

Proceedings of the Quantitative Evaluation of Systems - 10th International Conference, 2013

Parameterized Verification of Many Identical Probabilistic Timed Processes.

Nathalie Bertrand, Paulin Fournier

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012

Modal event-clock specifications for timed component-based design.

Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet

Sci. Comput. Program., 2012

Probabilistic ω-automata.

Christel Baier, Marcus Größer, Nathalie Bertrand

J. ACM, 2012

Off-line test selection with test purposes for non-deterministic timed automata

Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen

Log. Methods Comput. Sci., 2012

On the Decidability Status of Reachability and Coverability in Graph Transformation Systems.

Nathalie Bertrand, Giorgio Delzanno, Barbara König, Arnaud Sangnier, Jan Stückrath

Proceedings of the 23rd International Conference on Rewriting Techniques and Applications (RTA'12) , 2012

Playing Optimally on Timed Automata with Random Delays.

Nathalie Bertrand, Sven Schewe

Proceedings of the Formal Modeling and Analysis of Timed Systems, 2012

Bounded Satisfiability for PCTL.

Nathalie Bertrand, John Fearnley, Sven Schewe

Proceedings of the Computer Science Logic (CSL'12), 2012

2011

Emptiness and Universality Problems in Timed Automata with Positive Frequency.

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer

Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

Minimal Disclosure in Partially Observable Markov Decision Processes.

Nathalie Bertrand, Blaise Genest

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2011

2010

Probabilistic regular graphs

Nathalie Bertrand, Christophe Morvan

Proceedings of the Proceedings 12th International Workshop on Verification of Infinite-State Systems, 2010

2009

Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability

Christel Baier, Nathalie Bertrand, Marcus Größer

Proceedings of the Proceedings Eleventh International Workshop on Descriptional Complexity of Formal Systems, 2009

Probabilistic Acceptors for Languages over Infinite Words.

Christel Baier, Nathalie Bertrand, Marcus Größer

Proceedings of the SOFSEM 2009: Theory and Practice of Computer Science, 2009

Refinement and Consistency of Timed Modal Specifications.

Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet

Proceedings of the Language and Automata Theory and Applications, 2009

A Compositional Approach on Modal Specifications for Timed Systems.

Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet

Proceedings of the Formal Methods and Software Engineering, 2009

When Are Timed Automata Determinizable?

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye

Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

The Effect of Tossing Coins in Omega-Automata.

Christel Baier, Nathalie Bertrand, Marcus Größer

Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008

Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides

Nathalie Bertrand, Blaise Genest, Hugo Gimbert

CoRR, 2008

Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics.

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey

Proceedings of the Fifth International Conference on the Quantitative Evaluaiton of Systems (QEST 2008), 2008

Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata.

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer

Proceedings of the Twenty-Third Annual IEEE Symposium on Logic in Computer Science, 2008

On Decision Problems for Probabilistic Büchi Automata.

Christel Baier, Nathalie Bertrand, Marcus Größer

Proceedings of the Foundations of Software Science and Computational Structures, 2008

2007

Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

ACM Trans. Comput. Log., 2007

Probabilistic and Topological Semantics for Timed Automata.

Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer

Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006

Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones, et techniques de vérification automatique. (Stochastic models for Lossy Channel Systems and automated verification techniques).

Nathalie Bertrand

PhD thesis, 2006

A note on the attractor-property of infinite-state Markov chains.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

Inf. Process. Lett., 2006

On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Logic for Programming, 2006

Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness.

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2006

2005

Verification of probabilistic systems with faulty communication.

Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen

Inf. Comput., 2005

A Short Visit to the STS Hierarchy.

Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the 12th Workshop on Expressiveness on Concurrency, 2005

Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen

CoRR, 2005

1-identifying codes on trees.

Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein

Australas. J Comb., 2005

2004

Identifying and locating-dominating codes on chains and cycles.

Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein

Eur. J. Comb., 2004

2003

Model Checking Lossy Channels Systems Is Probably Decidable.

Nathalie Bertrand, Philippe Schnoebelen

Proceedings of the Foundations of Software Science and Computational Structures, 2003