Publications de Nathalie Bertrand

Thèses

  1. N. Bertrand, Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones et techniques de vérification automatique, Thèse de l'Laboratoire Spécification et Vérification, ENS Cachan, France, Septembre 2006. (détails)

Articles de journaux

  1. C. Baier, N. Bertrand, Ph. Schnoebelen, Verifying nondeterministic probabilistic channel systems against omega-regular linear-time properties, ACM Transactions on Computational Logic, 9(1), 2007. (détails) download
  2. C. Baier, N. Bertrand, Ph. Schnoebelen, A note on the attractor-property of infinite-state Markov chains, Information Processing Letters, 97(2):58-63, Janvier 2006. (détails)
  3. P.A. Abdulla, N. Bertrand, A. Rabinovich, Ph. Schnoebelen, Verification of Probabilistic Systems with Faulty Communication, Information and Computation, 202(2):141-165, Novembre 2005. (détails)
  4. N. Bertrand, I. Charon, O. Hudry, A. Lobstein, 1-Identifying Codes on Trees, Australasian Journal of Combinatorics, 31:21-35, Février 2005. (détails)
  5. N. Bertrand, I. Charon, O. Hudry, A. Lobstein, Identifying and Locating-Dominating Codes on Chains and Cycles, European Journal of Combinatorics, 25(7):969-987, Octobre 2004. (détails)

Conferences internationales

  1. C. Baier, N. Bertrand, M. Grosser, Probabilistic Acceptors for Languages over Infinite Words, in 35th Conference on Current Trends in Theory and Practice of Computer Science, LNCS No 5404, Spindleruv Mlyn, Czech, 2009. (détails)
  2. N. Bertrand, B. Genest, Gimbert. H, Qualitative Determinacy and Decidability of Stochastic Games with Signals, in 24th Annual IEEE Symposium on Logic in Computer Science (LICS'09), IEEE Computer Society Press (ed.), Los Angeles, CA, USA, Août 2009. (détails)
  3. C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, When are timed automata determinizable?, in 36th International Colloquium on Automata, Languages and Programming (ICALP'09), LNCS No 5556, Pages 43-54, Rhodes, Greece, Juillet 2009. (détails)
  4. N. Bertrand, S. Pinchinat, J.B. Raclet, Refinement and Consistency of Timed Modal Specifications, in Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA'09), LNCS No 5457, Pages 152-163, Tarragona, Spain, Avril 2009. (détails)
  5. N. Bertrand, P. Bouyer, Th. Brihaye, N. Markey, Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics, in Proceedings of the 5th International Conference on the Quantitative Evaluation of SysTems (QEST'08), Saint Malo, France, Septembre 2008. (détails)
  6. Christel Baier, Nathalie Bertrand, Patricia Bouyer, Thomas Brihaye, Marcus Groesser, Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata, in Proceedings of the 23rd Annual IEEE Symposium on Logic in Computer Science (LICS'08), Pittsburgh, PA, USA, Juin 2008. (détails)
  7. Christel Baier, Nathalie Bertrand, Marcus Groesser, On Decision Problems for Probabilistic Büchi Automata, in Proceedings of the 11th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'08), Budapest, Hungary, Mars 2008. (détails)
  8. C. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, M. Groesser, Probabilistic and Topological Semantics for Timed Automata, in Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), V. Arvind, Sanjiva Prasad (eds.), Volume 4855, New Delhi, India, Décembre 2007. (détails)
  9. C. Baier, N. Bertrand, Ph. Schnoebelen, Symbolic verification of communicating systems with probabilistic message losses: liveness and fairness, in Proceedings of 26th IFIP WG6.1 International Conference on Formal Techniques for Networked and Distributed Systems (FORTE'06), Elie Najm, Jean-Francois Pradat-Peyre, Véronique Vigui\' Donzeau-Gouge (eds.), Volume 4229, Pages 212-227, Paris, France, Septembre 2006. (détails)
  10. N. Bertrand, Ph. Schnoebelen, A short visit to the STS hierarchy, in Proceedings of the 12th International Workshop on Expressiveness in Concurrency (EXPRESS'05), Jos Baeten, Iain Phillips (eds.), Volume 154, Pages 59-69, San Francisco, CA, USA, Juillet 2006. (détails)
  11. N. Bertrand, Ph. Schnoebelen, Verifying Nondeterministic Channel Systems With Probabilistic Message Losses, in Proceedings of the 3rd International Workshop on Automated Verification of Infinite-State Systems (AVIS'04), Ramesh Bharadwaj (ed.), Barcelona, Spain, Avril 2004. (détails)
  12. N. Bertrand, Ph. Schnoebelen, Model Checking Lossy Channels Systems Is Probably Decidable, in Proceedings of the 6th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'03), AndrewD. Gordon (ed.), Volume 2620, Pages 120-135, Warsaw, Poland, Avril 2003. (détails)

Rapport de recherche

  1. C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, M. Grosser, A Probabilistic Semantics for Timed Automata, Research Report No LSV-08-13 Laboratoire Spécification et Vérification, ENS Cachan, France, Avril 2008. (détails)

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

This page has been automatically generated using the bib2html program.