Follow
Nathalie Bertrand
Nathalie Bertrand
Univ Rennes, Inria, CNRS, IRISA
Verified email at inria.fr - Homepage
Title
Cited by
Cited by
Year
Identifying and locating-dominating codes on chains and cycles
N Bertrand, I Charon, O Hudry, A Lobstein
European Journal of Combinatorics 25 (7), 969-987, 2004
1422004
On decision problems for probabilistic Büchi automata
C Baier, N Bertrand, M Größer
Foundations of Software Science and Computational Structures: 11th …, 2008
1052008
Probabilistic ω-automata
C Baier, M Größer, N Bertrand
Journal of the ACM (JACM) 59 (1), 1-52, 2012
942012
When are timed automata determinizable?
C Baier, N Bertrand, P Bouyer, T Brihaye
Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALP …, 2009
802009
Stochastic timed automata
N Bertrand, P Bouyer, T Brihaye, Q Menet, C Baier, M Größer, ...
Logical methods in computer science 10, 2014
722014
Qualitative determinacy and decidability of stochastic games with signals
N Bertrand, B Genest, H Gimbert
Journal of the ACM (JACM) 64 (5), 1-48, 2017
682017
Probabilistic and topological semantics for timed automata
C Baier, N Bertrand, P Bouyer, T Brihaye, M Größer
International Conference on Foundations of Software Technology and …, 2007
662007
A game approach to determinize timed automata
N Bertrand, A Stainer, T Jéron, M Krichen
Formal Methods in System Design 46 (1), 42-80, 2015
602015
Almost-sure model checking of infinite paths in one-clock timed automata
C Baier, N Bertrand, P Bouyer, T Brihaye, M GröBer
2008 23rd Annual IEEE Symposium on Logic in Computer Science, 217-226, 2008
582008
Off-line test selection with test purposes for non-deterministic timed automata
N Bertrand, T Jéron, A Stainer, M Krichen
Logical Methods in Computer Science 8, 2012
572012
Quantitative model-checking of one-clock timed automata under probabilistic semantics
N Bertrand, P Bouyer, T Brihaye, N Markey
2008 Fifth International Conference on Quantitative Evaluation of Systems, 55-64, 2008
572008
Verification of probabilistic systems with faulty communication
PA Abdulla, N Bertrand, A Rabinovich, P Schnoebelen
Information and Computation 202 (2), 141-165, 2005
542005
On the decidability status of reachability and coverability in graph transformation systems
N Bertrand, G Delzanno, B König, A Sangnier, J Stückrath
23rd International Conference on Rewriting Techniques and Applications (RTA …, 2012
502012
Active diagnosis for probabilistic systems
N Bertrand, E Fabre, S Haar, S Haddad, L Hélouët
International Conference on Foundations of Software Science and Computation …, 2014
492014
1-identifying codes on trees.
N Bertrand, I Charon, O Hudry, A Lobstein
Australas. J Comb. 31, 21-36, 2005
492005
Model checking lossy channels systems is probably decidable
N Bertrand, P Schnoebelen
Foundations of Software Science and Computation Structures: 6th …, 2003
462003
Foundation of diagnosis and predictability in probabilistic systems
N Bertrand, S Haddad, E Lefaucheux
IARCS Annual Conference on Foundations of Software Technology and …, 2014
442014
Parameterized verification of many identical probabilistic timed processes
N Bertrand, P Fournier
IARCS Annual Conference on Foundations of Software Technology and …, 2013
392013
Refinement and consistency of timed modal specifications
N Bertrand, S Pinchinat, JB Raclet
International Conference on Language and Automata Theory and Applications …, 2009
392009
Playing with probabilities in reconfigurable broadcast networks
N Bertrand, P Fournier, A Sangnier
Foundations of Software Science and Computation Structures: 17th …, 2014
352014
The system can't perform the operation now. Try again later.
Articles 1–20