default search action
Nathalie Bertrand 0001
Person information
- affiliation: IRISA / INRIA Rennes, France
Other persons with the same name
- Nathalie Bertrand 0002 — Hydro Quebec Research Institute, Canada
- Nathalie Bertrand 0003 — Institute for Radioprotection and Nuclear Safety (IRSN), Fontenay-aux-Roses, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i18]Nathalie Bertrand, Pranav Ghorpade, Sasha Rubin, Bernhard Scholz, Pavle Subotic:
Reusable Formal Verification of DAG-based Consensus Protocols. CoRR abs/2407.02167 (2024) - 2023
- [j25]Nathalie Bertrand, Hugo Francon, Nicolas Markey:
Synchronizing words under LTL constraints. Inf. Process. Lett. 182: 106392 (2023) - [i17]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 abs/2305.10546 (2023) - 2022
- [c55]Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur:
Semilinear Representations for Series-Parallel Atomic Congestion Games. FSTTCS 2022: 32:1-32:20 - [c54]Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger:
Parameterized Safety Verification of Round-Based Shared-Memory Systems. ICALP 2022: 113:1-113:20 - [c53]Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Brief Announcement: Holistic Verification of Blockchain Consensus. PODC 2022: 424-426 - [c52]Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Holistic Verification of Blockchain Consensus. DISC 2022: 10:1-10:24 - [i16]Nathalie Bertrand, Nicolas Markey, Ocan Sankur, Nicolas Waldburger:
Parameterized safety verification of round-based shared-memory systems. CoRR abs/2204.11670 (2022) - [i15]Nathalie Bertrand, Vincent Gramoli, Igor Konnov, Marijana Lazic, Pierre Tholoniat, Josef Widder:
Holistic Verification of Blockchain Consensus. CoRR abs/2206.04489 (2022) - 2021
- [j24]Luca Aceto, Nathalie Bertrand, Nobuko Yoshida:
Interviews with the 2021 CONCUR Test-of-Time Award Recipients. Bull. EATCS 135 (2021) - [j23]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. Log. Methods Comput. Sci. 17(1) (2021) - [j22]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): 797-821 (2021) - [j21]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): 823 (2021) - [c51]Nathalie Bertrand, Luca de Alfaro, Rob van Glabbeek, Catuscia Palamidessi, Nobuko Yoshida
:
CONCUR Test-Of-Time Award 2021 (Invited Paper). CONCUR 2021: 1:1-1:3 - [c50]Jakob Piribauer
Quantified Linear Temporal Logic over Probabilistic Systems with an Application to Vacuity Checking. CONCUR 2021: 7:1-7:18 - [c49]Nathalie Bertrand, Bastien Thomas, Josef Widder:
Guard Automata for the Verification of Safety and Liveness of Distributed Algorithms. CONCUR 2021: 15:1-15:17 - [c48]Nathalie Bertrand:
Distributed Algorithms: A Challenging Playground for Model Checking (Invited Talk). OPODIS 2021: 1:1-1:1 - [c47]Nathalie Bertrand
A Reduction Theorem for Randomized Distributed Algorithms Under Weak Adversaries. VMCAI 2021: 219-239 - 2020
- [j20]Nathalie Bertrand
Diagnosis and Degradation Control for Probabilistic Systems. Discret. Event Dyn. Syst. 30(4): 695-723 (2020) - [j19]Nathalie Bertrand:
Model checking randomized distributed algorithms. ACM SIGLOG News 7(1): 35-45 (2020) - [c46]Nathalie Bertrand
Synthesizing Safe Coalition Strategies. FSTTCS 2020: 39:1-39:17 - [c45]Nathalie Bertrand
Dynamic Network Congestion Games. FSTTCS 2020: 40:1-40:16 - [c44]Nathalie Bertrand
Concurrent Games with Arbitrarily Many Players (Invited Talk). MFCS 2020: 1:1-1:8 - [e4]Nathalie Bertrand
Formal Modeling and Analysis of Timed Systems - 18th International Conference, FORMATS 2020, Vienna, Austria, September 1-3, 2020, Proceedings. Lecture Notes in Computer Science 12288, Springer 2020, ISBN 978-3-030-57627-1 [contents] - [i14]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Synthesizing safe coalition strategies. CoRR abs/2008.03770 (2020) - [i13]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Paulin Fournier:
Taming denumerable Markov decision processes with decisiveness. CoRR abs/2008.10426 (2020) - [i12]Nathalie Bertrand, Nicolas Markey, Suman Sadhukhan, Ocan Sankur:
Dynamic network congestion games. CoRR abs/2009.13632 (2020)
2010 – 2019
- 2019
- [j18]Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
A tale of two diagnoses in probabilistic systems. Inf. Comput. 269 (2019) - [j17]Nathalie Bertrand, Miheer Dewaskar
Controlling a population. Log. Methods Comput. Sci. 15(3) (2019) - [j16]Luca Bortolussi
Introduction to the Special Issue on Qest 2017. ACM Trans. Model. Comput. Simul. 29(4): 19:1-19:2 (2019) - [c43]Nathalie Bertrand
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CONCUR 2019: 32:1-32:15 - [c42]Nathalie Bertrand
Verification of Randomized Consensus Algorithms Under Round-Rigid Adversaries. CONCUR 2019: 33:1-33:15 - [c41]Nathalie Bertrand
Concurrent Parameterized Games. FSTTCS 2019: 31:1-31:15 - [c40]Christel Baier
Long-run Satisfaction of Path Properties. LICS 2019: 1-14 - [c39]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: 59-76 - [i11]Nathalie Bertrand, Patricia Bouyer, Anirban Majumdar:
Reconfiguration and Message Losses in Parameterized Broadcast Networks. CoRR abs/1912.07042 (2019) - 2018
- [j15]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are stochastic transition systems tameable? J. Log. Algebraic Methods Program. 99: 41-96 (2018) - [c38]Christel Baier
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. LICS 2018: 86-94 - [c37]A. R. Balasubramanian
Parameterized Verification of Synchronization in Constrained Reconfigurable Broadcast Networks. TACAS (2) 2018: 38-54 - [i10]A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey:
Parameterized verification of synchronization in constrained reconfigurable broadcast networks. CoRR abs/1802.08469 (2018) - [i9]Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur:
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. CoRR abs/1804.11301 (2018) - [i8]Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert, Adwait Amit Godbole:
Controlling a population. CoRR abs/1807.00893 (2018) - 2017
- [j14]Aaron Bohy, Véronique Bruyère, Jean-François Raskin
Symblicit algorithms for mean-payoff and shortest path in monotonic Markov decision processes. Acta Informatica 54(6): 545-587 (2017) - [j13]Nathalie Bertrand
Qualitative Determinacy and Decidability of Stochastic Games with Signals. J. ACM 64(5): 33:1-33:48 (2017) - [c36]Nathalie Bertrand
Controlling a Population. CONCUR 2017: 12:1-12:16 - [e3]Nathalie Bertrand
Quantitative Evaluation of Systems - 14th International Conference, QEST 2017, Berlin, Germany, September 5-7, 2017, Proceedings. Lecture Notes in Computer Science 10503, Springer 2017, ISBN 978-3-319-66334-0 [contents] - [i7]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are Stochastic Transition Systems Tameable? CoRR abs/1703.04806 (2017) - [i6]Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert:
Controlling a Population. CoRR abs/1707.02058 (2017) - 2016
- [j12]Nathalie Bertrand
Editorial: Quantitative Aspects of Programming Languages and Systems. Theor. Comput. Sci. 655: 91 (2016) - [c35]Nathalie Bertrand
Diagnosis in Infinite-State Probabilistic Systems. CONCUR 2016: 37:1-37:15 - [c34]Nathalie Bertrand
Analysing Decisive Stochastic Processes. ICALP 2016: 101:1-101:14 - [c33]Nathalie Bertrand
Accurate Approximate Diagnosability of Stochastic Systems. LATA 2016: 549-561 - 2015
- [b2]Nathalie Bertrand:
Contributions to the verification and control of timed and probabilistic models : Mémoire d'habilitation à diriger des recherches. University of Rennes 1, France, 2015 - [j11]Nathalie Bertrand
A game approach to determinize timed automata. Formal Methods Syst. Des. 46(1): 42-80 (2015) - [c32]Nathalie Bertrand
Distributed Local Strategies in Broadcast Networks. CONCUR 2015: 44-57 - [e2]Nathalie Bertrand
Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2015, London, UK, 11th-12th April 2015. EPTCS 194, 2015 [contents] - 2014
- [j10]Nathalie Bertrand
Stochastic Timed Automata. Log. Methods Comput. Sci. 10(4) (2014) - [c31]Nathalie Bertrand
Active Diagnosis for Probabilistic Systems. FoSSaCS 2014: 29-42 - [c30]Nathalie Bertrand
Playing with Probabilities in Reconfigurable Broadcast Networks. FoSSaCS 2014: 134-148 - [c29]Nathalie Bertrand
Foundation of Diagnosis and Predictability in Probabilistic Systems. FSTTCS 2014: 417-429 - [c28]Nathalie Bertrand
Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata. QEST 2014: 313-328 - [e1]Nathalie Bertrand
Proceedings Twelfth International Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2014, Grenoble, France, 12-13 April 2014. EPTCS 154, 2014 [contents] - 2013
- [j9]Nathalie Bertrand
Computable fixpoints in well-structured symbolic model checking. Formal Methods Syst. Des. 43(2): 233-267 (2013) - [c27]Nathalie Bertrand
Parameterized Verification of Many Identical Probabilistic Timed Processes. FSTTCS 2013: 501-513 - [c26]S. Akshay, Nathalie Bertrand
The Steady-State Control Problem for Markov Decision Processes. QEST 2013: 290-304 - [c25]Paolo Ballarini, Nathalie Bertrand
Transient Analysis of Networks of Stochastic Timed Automata Using Stochastic State Classes. QEST 2013: 355-371 - [c24]Nathalie Bertrand
Solving Stochastic Büchi Games on Infinite Decisive Arenas. QAPL 2013: 116-131 - [i5]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. CoRR abs/1309.2842 (2013) - 2012
- [j8]Nathalie Bertrand
Off-line test selection with test purposes for non-deterministic timed automata. Log. Methods Comput. Sci. 8(4) (2012) - [j7]Christel Baier, Marcus Größer, Nathalie Bertrand
Probabilistic ω-automata. J. ACM 59(1): 1:1-1:52 (2012) - [j6]Nathalie Bertrand
Modal event-clock specifications for timed component-based design. Sci. Comput. Program. 77(12): 1212-1234 (2012) - [c23]Nathalie Bertrand
Bounded Satisfiability for PCTL. CSL 2012: 92-106 - [c22]Nathalie Bertrand
Playing Optimally on Timed Automata with Random Delays. FORMATS 2012: 43-58 - [c21]Nathalie Bertrand
On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. RTA 2012: 101-116 - [i4]Nathalie Bertrand, John Fearnley, Sven Schewe:
Bounded Satisfiability for PCTL. CoRR abs/1204.0469 (2012) - 2011
- [c20]Nathalie Bertrand
A Game Approach to Determinize Timed Automata. FoSSaCS 2011: 245-259 - [c19]Nathalie Bertrand
Minimal Disclosure in Partially Observable Markov Decision Processes. FSTTCS 2011: 411-422 - [c18]Nathalie Bertrand
Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) 2011: 246-257 - [c17]Nathalie Bertrand
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata. TACAS 2011: 96-111 - 2010
- [c16]Nathalie Bertrand, Christophe Morvan:
Probabilistic regular graphs. INFINITY 2010: 77-90
2000 – 2009
- 2009
- [c15]Christel Baier, Nathalie Bertrand
The Effect of Tossing Coins in Omega-Automata. CONCUR 2009: 15-29 - [c14]Christel Baier, Nathalie Bertrand
When Are Timed Automata Determinizable? ICALP (2) 2009: 43-54 - [c13]Nathalie Bertrand
A Compositional Approach on Modal Specifications for Timed Systems. ICFEM 2009: 679-697 - [c12]Nathalie Bertrand
Refinement and Consistency of Timed Modal Specifications. LATA 2009: 152-163 - [c11]Nathalie Bertrand
Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS 2009: 319-328 - [c10]Christel Baier, Nathalie Bertrand
Probabilistic Acceptors for Languages over Infinite Words. SOFSEM 2009: 19-33 - [c9]Christel Baier, Nathalie Bertrand
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability. DCFS 2009: 3-16 - 2008
- [c8]Christel Baier, Nathalie Bertrand
On Decision Problems for Probabilistic Büchi Automata. FoSSaCS 2008: 287-301 - [c7]Christel Baier, Nathalie Bertrand
Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata. LICS 2008: 217-226 - [c6]Nathalie Bertrand
Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics. QEST 2008: 55-64 - [i3]Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Determinacy and Decidability of Reachability Games with Partial Observation on Both Sides. CoRR abs/0811.3975 (2008) - 2007
- [j5]Christel Baier, Nathalie Bertrand
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9(1): 5 (2007) - [c5]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Größer:
Probabilistic and Topological Semantics for Timed Automata. FSTTCS 2007: 179-191 - 2006
- [b1]Nathalie Bertrand:
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). École normale supérieure de Cachan, France, 2006 - [j4]Christel Baier, Nathalie Bertrand
A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97(2): 58-63 (2006) - [c4]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE 2006: 212-227 - [c3]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
On Computing Fixpoints in Well-Structured Regular Model Checking, with Applications to Lossy Channel Systems. LPAR 2006: 347-361 - [i2]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. CoRR abs/cs/0606091 (2006) - 2005
- [j3]Nathalie Bertrand, Irène Charon, Olivier Hudry, Antoine Lobstein:
1-identifying codes on trees. Australas. J Comb. 31: 21-36 (2005) - [j2]Parosh Aziz Abdulla, Nathalie Bertrand
Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005) - [c2]Nathalie Bertrand
A Short Visit to the STS Hierarchy. EXPRESS 2005: 59-69 - [i1]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Verifying nondeterministic probabilistic channel systems against $\omega$-regular linear-time properties. CoRR abs/cs/0511023 (2005) - 2004
- [j1]Nathalie Bertrand
Identifying and locating-dominating codes on chains and cycles. Eur. J. Comb. 25(7): 969-987 (2004) - 2003
- [c1]Nathalie Bertrand, Philippe Schnoebelen:
Model Checking Lossy Channels Systems Is Probably Decidable. FoSSaCS 2003: 120-135
Coauthor Index
Patricia Bouyer
aka: Patricia Bouyer-Decitre
aka: Patricia Bouyer-Decitre
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: