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
1162004
On decision problems for probabilistic Büchi automata
C Baier, N Bertrand, M Größer
International Conference on Foundations of Software Science and …, 2008
922008
Probabilistic ω-automata
C Baier, M Größer, N Bertrand
Journal of the ACM (JACM) 59 (1), 1-52, 2012
752012
When are timed automata determinizable?
C Baier, N Bertrand, P Bouyer, T Brihaye
International Colloquium on Automata, Languages, and Programming, 43-54, 2009
592009
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
572007
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
532008
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
512017
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
512008
Verification of probabilistic systems with faulty communication
PA Abdulla, N Bertrand, A Rabinovich, P Schnoebelen
Information and Computation 202 (2), 141-165, 2005
492005
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'12), 2012
442012
Model checking lossy channels systems is probably decidable
N Bertrand, P Schnoebelen
International Conference on Foundations of Software Science and Computation …, 2003
412003
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
402014
Foundation of diagnosis and predictability in probabilistic systems
N Bertrand, S Haddad, E Lefaucheux
392014
Refinement and consistency of timed modal specifications
N Bertrand, S Pinchinat, JB Raclet
International Conference on Language and Automata Theory and Applications …, 2009
392009
1-identifying codes on trees.
N Bertrand, I Charon, O Hudry, A Lobstein
Australas. J Comb. 31, 21-36, 2005
392005
Stochastic Timed Automata
M Jurdzinski, M Groesser, C Baier, Q Menet, T Brihaye, P Bouyer, ...
Logical Methods in Computer Science 10, 2014
37*2014
Off-line test selection with test purposes for non-deterministic timed automata
N Bertrand, T Jéron, A Stainer, M Krichen
International Conference on Tools and Algorithms for the Construction and …, 2011
342011
A compositional approach on modal specifications for timed systems
N Bertrand, A Legay, S Pinchinat, JB Raclet
International Conference on Formal Engineering Methods, 679-697, 2009
332009
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time properties
C Baier, N Bertrand, P Schnoebelen
ACM Transactions on Computational Logic (TOCL) 9 (1), 5-es, 2007
292007
Computable fixpoints in well-structured symbolic model checking
N Bertrand, P Schnoebelen
Formal Methods in System Design 43 (2), 233-267, 2013
282013
The system can't perform the operation now. Try again later.
Articles 1–20