Google
Google Scholar
MS Academic
CiteSeerX
CORE
Semantic ScholarNathalie Bertrand 0001
Person information
- affiliation: IRISA / INRIA Rennes, France
Other persons with the same name
- Nathalie Bertrand
- 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
2010 – today
- 2018
[j16]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
When are stochastic transition systems tameable? J. Log. Algebr. Meth. Program. 99: 41-96 (2018)- [c37]Christel Baier, Nathalie Bertrand, Clemens Dubslaff, Daniel Gburek, Ocan Sankur:
Stochastic Shortest Paths and Weight-Bounded Properties in Markov Decision Processes. LICS 2018: 86-94 - [c36]A. R. Balasubramanian, Nathalie Bertrand, Nicolas Markey:
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
- [j15]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 Inf. 54(6): 545-587 (2017) - [j14]Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Qualitative Determinacy and Decidability of Stochastic Games with Signals. J. ACM 64(5): 33:1-33:48 (2017) - [c35]Nathalie Bertrand, Miheer Dewaskar, Blaise Genest, Hugo Gimbert:
Controlling a Population. CONCUR 2017: 12:1-12:16 - [e3]Nathalie Bertrand, Luca Bortolussi:
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
- [j13]Nathalie Bertrand, Luca Bortolussi, Herbert Wiklicky:
Editorial: Quantitative Aspects of Programming Languages and Systems. Theor. Comput. Sci. 655: 91 (2016) - [c34]Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
Diagnosis in Infinite-State Probabilistic Systems. CONCUR 2016: 37:1-37:15 - [c33]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Pierre Carlier:
Analysing Decisive Stochastic Processes. ICALP 2016: 101:1-101:14 - [c32]Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
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 - [j12]Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen:
A game approach to determinize timed automata. Formal Methods in System Design 46(1): 42-80 (2015) - [c31]Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier:
Distributed Local Strategies in Broadcast Networks. CONCUR 2015: 44-57 - [e2]Nathalie Bertrand, Mirco Tribastone:
Proceedings Thirteenth Workshop on Quantitative Aspects of Programming Languages and Systems, QAPL 2015, London, UK, 11th-12th April 2015. EPTCS 194, 2015 [contents] - 2014
- [j11]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Quentin Menet, Christel Baier, Marcus Größer, Marcin Jurdzinski:
Stochastic Timed Automata. Logical Methods in Computer Science 10(4) (2014) - [c30]Nathalie Bertrand, Eric Fabre, Stefan Haar, Serge Haddad, Loïc Hélouët:
Active Diagnosis for Probabilistic Systems. FoSSaCS 2014: 29-42 - [c29]Nathalie Bertrand, Paulin Fournier, Arnaud Sangnier:
Playing with Probabilities in Reconfigurable Broadcast Networks. FoSSaCS 2014: 134-148 - [c28]Nathalie Bertrand, Serge Haddad, Engel Lefaucheux:
Foundation of Diagnosis and Predictability in Probabilistic Systems. FSTTCS 2014: 417-429 - [c27]Nathalie Bertrand, Thomas Brihaye, Blaise Genest:
Deciding the Value 1 Problem for Reachability in 1-Clock Decision Stochastic Timed Automata. QEST 2014: 313-328 - [e1]Nathalie Bertrand, Luca Bortolussi:
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
- [j10]Nathalie Bertrand, Philippe Schnoebelen:
Computable fixpoints in well-structured symbolic model checking. Formal Methods in System Design 43(2): 233-267 (2013) - [c26]Nathalie Bertrand, Paulin Fournier:
Parameterized Verification of Many Identical Probabilistic Timed Processes. FSTTCS 2013: 501-513 - [c25]S. Akshay, Nathalie Bertrand, Serge Haddad, Loïc Hélouët:
The Steady-State Control Problem for Markov Decision Processes. QEST 2013: 290-304 - [c24]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: 355-371 - [c23]Nathalie Bertrand, Philippe Schnoebelen:
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
- [j9]Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen:
Off-line test selection with test purposes for non-deterministic timed automata. Logical Methods in Computer Science 8(4) (2012) - [j8]Christel Baier, Marcus Größer, Nathalie Bertrand:
Probabilistic ω-automata. J. ACM 59(1): 1:1-1:52 (2012) - [j7]Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet:
Modal event-clock specifications for timed component-based design. Sci. Comput. Program. 77(12): 1212-1234 (2012) - [c22]
- [c21]Nathalie Bertrand, Sven Schewe:
Playing Optimally on Timed Automata with Random Delays. FORMATS 2012: 43-58 - [c20]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: 101-116 - [i4]Nathalie Bertrand, John Fearnley, Sven Schewe:
Bounded Satisfiability for PCTL. CoRR abs/1204.0469 (2012) - 2011
- [c19]Nathalie Bertrand, Amélie Stainer, Thierry Jéron, Moez Krichen:
A Game Approach to Determinize Timed Automata. FoSSaCS 2011: 245-259 - [c18]Nathalie Bertrand, Blaise Genest:
Minimal Disclosure in Partially Observable Markov Decision Processes. FSTTCS 2011: 411-422 - [c17]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Amélie Stainer:
Emptiness and Universality Problems in Timed Automata with Positive Frequency. ICALP (2) 2011: 246-257 - [c16]Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen:
Off-Line Test Selection with Test Purposes for Non-deterministic Timed Automata. TACAS 2011: 96-111 - 2010
- [c15]
2000 – 2009
- 2009
- [c14]Christel Baier, Nathalie Bertrand, Marcus Größer:
The Effect of Tossing Coins in Omega-Automata. CONCUR 2009: 15-29 - [c13]Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye:
When Are Timed Automata Determinizable? ICALP (2) 2009: 43-54 - [c12]Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Jean-Baptiste Raclet:
A Compositional Approach on Modal Specifications for Timed Systems. ICFEM 2009: 679-697 - [c11]Nathalie Bertrand, Sophie Pinchinat, Jean-Baptiste Raclet:
Refinement and Consistency of Timed Modal Specifications. LATA 2009: 152-163 - [c10]Nathalie Bertrand, Blaise Genest, Hugo Gimbert:
Qualitative Determinacy and Decidability of Stochastic Games with Signals. LICS 2009: 319-328 - [c9]Christel Baier, Nathalie Bertrand, Marcus Größer:
Probabilistic Acceptors for Languages over Infinite Words. SOFSEM 2009: 19-33 - [c8]Christel Baier, Nathalie Bertrand, Marcus Größer:
Probabilistic Automata over Infinite Words: Expressiveness, Efficiency, and Decidability. DCFS 2009: 3-16 - 2008
- [c7]Christel Baier, Nathalie Bertrand, Marcus Größer:
On Decision Problems for Probabilistic Büchi Automata. FoSSaCS 2008: 287-301 - [c6]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: 217-226 - [c5]Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Nicolas Markey:
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
- [j6]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9(1): 5 (2007) - [c4]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 - [j5]Nathalie Bertrand, Philippe Schnoebelen:
A Short Visit to the STS Hierarchy. Electr. Notes Theor. Comput. Sci. 154(3): 59-69 (2006) - [j4]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
A note on the attractor-property of infinite-state Markov chains. Inf. Process. Lett. 97(2): 58-63 (2006) - [c3]Christel Baier, Nathalie Bertrand, Philippe Schnoebelen:
Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE 2006: 212-227 - [c2]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. Australasian J. Combinatorics 31: 21-36 (2005) - [j2]Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Philippe Schnoebelen:
Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005) - [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, Irène Charon, Olivier Hudry, Antoine Lobstein:
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
maintained by 
, founded at 
, founded at 
last updated on 2019-02-08 21:57 CET by the dblp team
data released under the ODC-BY 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
