Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Nathalie Bertrand
Author information
- IRISA / INRIA Rennes, France
Other persons with the same name
- Nathalie Bertrand 0002 — Hydro Quebec Research Institute, Canada
2010 – today
- 2012
[j8]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)- [j7]
- [j6]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
- [i5]Nathalie Bertrand, John Fearnley, Sven Schewe: Bounded Satisfiability for PCTL. CoRR abs/1204.0469 (2012)
- [i4]Nathalie Bertrand, Philippe Schnoebelen: Solving Stochastic Büchi Games on Infinite Decisive Arenas. CoRR abs/1207.4577 (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
- [j5]Christel Baier, Nathalie Bertrand, Ph. Schnoebelen: Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties. ACM Trans. Comput. Log. 9(1) (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
- [j4]Nathalie Bertrand, Ph. Schnoebelen: A Short Visit to the STS Hierarchy. Electr. Notes Theor. Comput. Sci. 154(3): 59-69 (2006)
- [j3]Christel Baier, Nathalie Bertrand, Ph. 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, Ph. Schnoebelen: Symbolic Verification of Communicating Systems with Probabilistic Message Losses: Liveness and Fairness. FORTE 2006: 212-227
- [c2]Christel Baier, Nathalie Bertrand, Ph. 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, Ph. Schnoebelen: On computing fixpoints in well-structured regular model checking, with applications to lossy channel systems. CoRR abs/cs/0606091 (2006)
- 2005
- [j2]Parosh Aziz Abdulla, Nathalie Bertrand, Alexander Moshe Rabinovich, Ph. Schnoebelen: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2): 141-165 (2005)
- [i1]Christel Baier, Nathalie Bertrand, Ph. 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, Ph. Schnoebelen: Model Checking Lossy Channels Systems Is Probably Decidable. FoSSaCS 2003: 120-135
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-02 22:10 CET by the dblp team