Nathalie Bertrand

发表

1-identifying Codes on Trees

Nathalie Bertrand, Antoine Lobstein, Irène Charon, 2005, Australas. J Comb..

Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata

Nathalie Bertrand, Thierry Jéron, Amélie Stainer, 2011, TACAS.

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

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen, 2006, LPAR.

Modal event-clock specifications for timed component-based design

Nathalie Bertrand, Axel Legay, Sophie Pinchinat, 2012, Sci. Comput. Program..

uchi Games on Infinite Arenas with a Finite Attractor

Nathalie Bertrand, Philippe Schnoebelen, N. Bertrand, 2012, 1207.4577.

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

Nathalie Bertrand, Hugo Gimbert, Blaise Genest, 2008, ArXiv.

Introduction Intro to timed automata Region abstraction Limits Extensions Implementation Conclusion

Nathalie Bertrand, 2010 .

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

Christel Baier, Nathalie Bertrand, Marcus Größer, 2009, DCFS.

Analysing Decisive Stochastic Processes

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, 2016, ICALP.

A Compositional Approach on Modal Specifications for Timed Systems

Nathalie Bertrand, Axel Legay, Sophie Pinchinat, 2009, ICFEM.

Probabilistic regular graphs

Nathalie Bertrand, Christophe Morvan, 2010, INFINITY.

When are Stochastic Transition Systems Tameable?

Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, 2017, J. Log. Algebraic Methods Program..

The Steady-State Control Problem for Markov Decision Processes

Nathalie Bertrand, Loïc Hélouët, Serge Haddad, 2013, QEST.

Playing Optimally on Timed Automata with Random Delays

Nathalie Bertrand, Sven Schewe, 2012, FORMATS.

Active Diagnosis for Probabilistic Systems

Nathalie Bertrand, Loïc Hélouët, Serge Haddad, 2014, FoSSaCS.

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

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen, 2006, Inf. Process. Lett..

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

Nathalie Bertrand, Patricia Bouyer, Nicolas Markey, 2008, 2008 Fifth International Conference on Quantitative Evaluation of Systems.

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

Christel Baier, Nathalie Bertrand, Ocan Sankur, 2018, LICS.

Computable fixpoints in well-structured symbolic model checking

Nathalie Bertrand, Philippe Schnoebelen, N. Bertrand, 2013, Formal Methods Syst. Des..

A Game Approach to Determinize Timed Automata

Nathalie Bertrand, Thierry Jéron, Amélie Stainer, 2011, FoSSaCS.

Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2014, Grenoble, France, 12-13 April 2014

Nathalie Bertrand, Luca Bortolussi, 2014, QAPL.

A game approach to determinize timed automata

Nathalie Bertrand, Thierry Jéron, Amélie Stainer, 2011, Formal Methods Syst. Des..

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

Nathalie Bertrand, Thierry Jéron, Amélie Stainer, 2012, Log. Methods Comput. Sci..

Parameterized verification of synchronization in constrained reconfigurable broadcast networks

Nathalie Bertrand, Nicolas Markey, A. R. Balasubramanian, 2018, TACAS.

Verification of Randomized Distributed Algorithms under Round-Rigid Adversaries

Nathalie Bertrand, Josef Widder, Igor Konnov, 2018 .

Parameterized Verification of Many Identical Probabilistic Timed Processes

Nathalie Bertrand, Paulin Fournier, 2013, FSTTCS.

Identifying and locating-dominating codes on chains and cycles

Nathalie Bertrand, Antoine Lobstein, Irène Charon, 2004, Eur. J. Comb..

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

Nathalie Bertrand, Thomas Brihaye, Blaise Genest, 2014, QEST.

Decisiveness and stochastic timed automata

Nathalie Bertrand, Thomas Brihaye, Patricia Bouyer-Decitre, 2016 .

Editorial: Quantitative Aspects of Programming Languages and Systems

Nathalie Bertrand, Herbert Wiklicky, Luca Bortolussi, 2016, Theor. Comput. Sci..

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

Nathalie Bertrand, Giorgio Delzanno, Barbara König, 2012, RTA.

Verification of probabilistic systems with faulty communication

Parosh Aziz Abdulla, Nathalie Bertrand, Philippe Schnoebelen, 2005, Inf. Comput..

Refinement and Consistency of Timed Modal Specifications

Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet, 2009, LATA.

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, 2006 .

Bounded Satisfiability for PCTL

Nathalie Bertrand, Sven Schewe, John Fearnley, 2012, CSL.

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

Nathalie Bertrand, 2015 .

Probabilistic and Topological Semantics for Timed Automata

Christel Baier, Nathalie Bertrand, Patricia Bouyer, 2007, FSTTCS.

Solving Stochastic Büchi Games on Infinite Decisive Arenas

Nathalie Bertrand, Philippe Schnoebelen, N. Bertrand, 2012, QAPL.

New Results - Model expressivity andquantitative verification

Nathalie Bertrand, Loïc Hélouët, Amélie Stainer, 2013 .

Playing with Probabilities in Reconfigurable Broadcast Networks

Nathalie Bertrand, Arnaud Sangnier, Paulin Fournier, 2014, FoSSaCS.

Model Checking Lossy Channels Systems Is Probably Decidable

Nathalie Bertrand, Philippe Schnoebelen, N. Bertrand, 2003, FoSSaCS.

Stochastic Timed Automata

Christel Baier, Nathalie Bertrand, Patricia Bouyer, 2014, Log. Methods Comput. Sci..

A Probabilistic Semantics for Timed Automata

Christel Baier, Nathalie Bertrand, Patricia Bouyer, 2008 .

Foundation of Diagnosis and Predictability in Probabilistic Systems

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux, 2014, FSTTCS.

Minimal Disclosure in Partially Observable Markov Decision Processes

Nathalie Bertrand, Blaise Genest, N. Bertrand, 2011, FSTTCS.

The Effect of Tossing Coins in Omega-Automata

Christel Baier, Nathalie Bertrand, Marcus Größer, 2009, CONCUR.

Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2015, London, UK, 11th-12th April 2015

Nathalie Bertrand, Mirco Tribastone, 2015, QAPL.

When Are Timed Automata Determinizable?

Christel Baier, Nathalie Bertrand, Patricia Bouyer, 2009, ICALP.

Qualitative Determinacy and Decidability of Stochastic Games with Signals

Nathalie Bertrand, Hugo Gimbert, Blaise Genest, 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

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

Christel Baier, Nathalie Bertrand, Philippe Schnoebelen, 2005, TOCL.

A tale of two diagnoses in probabilistic systems

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux, 2019, Inf. Comput..

Emptiness and Universality Problems in Timed Automata with Positive Frequency pdf

Nathalie Bertrand, Patricia Bouyer, Amélie Stainer, 2011, ICALP.

Probabilistic Acceptors for Languages over Infinite Words

Christel Baier, Nathalie Bertrand, Marcus Größer, 2009, SOFSEM.

On Decision Problems for Probabilistic Büchi Automata

Christel Baier, Nathalie Bertrand, Marcus Größer, 2008, FoSSaCS.

Accurate Approximate Diagnosability of Stochastic Systems

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux, 2016, LATA.

Diagnosis in Infinite-State Probabilistic Systems

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux, 2016, CONCUR.

Performance Evaluation of Metro Regulations Using Probabilistic Model-Checking

Nathalie Bertrand, Loïc Hélouët, Ocan Sankur, 2019, RSSRail.

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

Nathalie Bertrand, Enrico Vicario, Paolo Ballarini, 2013, QEST.

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

Christel Baier, Nathalie Bertrand, Patricia Bouyer, 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

Probabilistic ω-automata

Christel Baier, Nathalie Bertrand, Marcus Größer, 2012, JACM.

A Probabilistic Semantics for

Christel Baier, Nathalie Bertrand, Patricia Bouyer, 2008 .

Verifying Nondeterministic Channel Systems With Probabilistic Message Losses 3

Nathalie Bertrand, N. Bertrand, 2004 .

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

Nathalie Bertrand, Josef Widder, Bastien Thomas, 2021, CONCUR.

Verification of randomized consensus algorithms under round-rigid adversaries

Nathalie Bertrand, Josef Widder, Igor Konnov, 2021, Int. J. Softw. Tools Technol. Transf..

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

Nathalie Bertrand, Luca de Alfaro, Catuscia Palamidessi, 2021, CONCUR.

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

Christel Baier, Nathalie Bertrand, Ocan Sankur, 2021, CONCUR.

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

Nathalie Bertrand, Josef Widder, Igor Konnov, 2021 .

Diagnosis in Infinite-State Probabilistic Systems (long version)

Nathalie Bertrand, Serge Haddad, Engel Lefaucheux, 2016 .

Distributed Local Strategies in Broadcast Networks

Nathalie Bertrand, Arnaud Sangnier, Paulin Fournier, 2015, CONCUR.