Nathalie Bertrand
Nathalie Bertrand
Univ Rennes, Inria, CNRS, IRISA
Verified email at - Homepage
Cited by
Cited by
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
On decision problems for probabilistic Buchi automata
C Baier, N Bertrand, M Grosser
Lecture Notes in Computer Science 4962, 287-301, 2008
Probabilistic ω-automata
C Baier, M Gr÷▀er, N Bertrand
Journal of the ACM (JACM) 59 (1), 1-52, 2012
When are timed automata determinizable?
C Baier, N Bertrand, P Bouyer, T Brihaye
Automata, Languages and Programming: 36th Internatilonal Collogquium, ICALPá…, 2009
Probabilistic and topological semantics for timed automata
C Baier, N Bertrand, P Bouyer, T Brihaye, M Gr÷▀er
FSTTCS 2007: Foundations of Software Technology and Theoretical Computerá…, 2007
Stochastic timed automata
N Bertrand, P Bouyer, T Brihaye, Q Menet, C Baier, M Gr÷▀er, ...
arXiv preprint arXiv:1410.2128, 2014
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
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
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
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
A game approach to determinize timed automata
N Bertrand, A Stainer, T JÚron, M Krichen
Formal Methods in System Design 46, 42-80, 2015
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
Verification of probabilistic systems with faulty communication
PA Abdulla, N Bertrand, A Rabinovich, P Schnoebelen
Information and Computation 202 (2), 141-165, 2005
Active diagnosis for probabilistic systems
N Bertrand, E Fabre, S Haar, S Haddad, L HÚlouŰt
Foundations of Software Science and Computation Structures: 17thá…, 2014
1-identifying codes on trees.
N Bertrand, I Charon, O Hudry, A Lobstein
Australas. J Comb. 31, 21-36, 2005
Model checking lossy channels systems is probably decidable
N Bertrand, P Schnoebelen
Foundations of Software Science and Computation Structures: 6thá…, 2003
Foundation of diagnosis and predictability in probabilistic systems
N Bertrand, S Haddad, E Lefaucheux
IARCS Annual Conference on Foundations of Software Technology andá…, 2014
Refinement and consistency of timed modal specifications
N Bertrand, S Pinchinat, JB Raclet
Language and Automata Theory and Applications: Third Internationalá…, 2009
A compositional approach on modal specifications for timed systems
N Bertrand, A Legay, S Pinchinat, JB Raclet
Formal Methods and Software Engineering: 11th International Conference oná…, 2009
Playing with probabilities in reconfigurable broadcast networks
N Bertrand, P Fournier, A Sangnier
Foundations of Software Science and Computation Structures: 17thá…, 2014
The system can't perform the operation now. Try again later.
Articles 1–20