Publications of Nathalie Bertrand

Load the BibTeX file

Academic Journals

1. Nathalie Bertrand, Axel Legay, Sophie Pinchinat, Raclet Jean-Baptiste. Modal event-clock specifications for timed component-based design. Science of Computer Programming, 77:1212-1234, 2012.
2. C. Baier, M. Grösser, N. Bertrand. Probabilistic w-automata. Journal of the ACM, 59(1), February 2012.
3. 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.
4. C. Baier, N. Bertrand, Ph. Schnoebelen. A note on the attractor-property of infinite-state Markov chains. Information Processing Letters, 97(2):58-63, January 2006.
5. P.A. Abdulla, N. Bertrand, A. Rabinovich, Ph. Schnoebelen. Verification of Probabilistic Systems with Faulty Communication. Information and Computation, 202(2):141-165, November 2005. download
6. N. Bertrand, I. Charon, O. Hudry, A. Lobstein. 1-Identifying Codes on Trees. Australasian Journal of Combinatorics, 31:21-35, February 2005.
7. 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, October 2004. download

International Conferences

1. N. Bertrand, J. Fearnley, S. Schewe. Bounded Satisfiability for PCTL. In proceedings of the 21st EACSL Annual Conferences on Computer Science Logic (CSL'12), LIPIcs, Pages 92-106, Fontainebleau, France, September 2012.
2. N. Bertrand, S. Schewe. Playing Optimally on Timed Automata with Random Delays. In proceedings of the 10th International Conference on Formal Modeling and Analysis of Timed Systems (Formats'12), LNCS, Volume 7595, Pages 43-58, London, UK, September 2012.
3. N. Bertrand, G. Delzanno, B. König, A. Sangnier, J. Stückrath. On the Decidability Status of Reachability and Coverability in Graph Transformation Systems. In 23rd International Conference on Rewriting Techniques and Applications, LIPIcs 15, Pages 101-116, Nagoya, Japan, May 2012.
4. N. Bertrand, B. Genest. Minimal Disclosure in Partially Observable Markov Decision Processes . In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2011), Leibniz International Proceedings in Informatics (LIPIcs), Volume 13, Pages 411-422, Bombay, India, 2011. download
5. N. Bertrand, P Bouyer, Th. Brihaye, A. Stainer. Emptiness and Universality Problems in Timed Automata with Positive Frequency. In Proceedings of the 38th International Colloquium on Automata, Languages and Programming (ICALP'11), LNCS, Volume 6756, Pages 246-257, Zürich, Switzerland, July 2011.
6. N. Bertrand, T. Jéron, A. Stainer, M. Krichen. Off-line Test Selection with Test Purposes for Non-Deterministic Timed Automata. In 17th International Conference on Tools and Algorithms for the Construction And Analysis of Systems (TACAS), LNCS, Volume 6605, Pages 96-111, Saarbrücken, Germany, April 2011.
7. N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. In 14th International Conference on Foundations of Software Science and Computation Structures (FOSSACS), LNCS, Volume 6604, Pages 245-259, Saarbrücken, Germany, April 2011.
8. N. Bertrand, C. Morvan. Probabilistic Regular Graphs. In Infinity, EPTCS, Volume 39, Pages 77-90, Singapore, September 2010.
9. 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, Volume 5404, Pages 19-33, Spindleruv Mlyn, Czech, 2009.
10. N. Bertrand, A. Legay, S. Pinchinat, J-P. Raclet. A Compositional Approach on Modal Specifications for Timed Systems. In Proceedings of the 11th International Conference on Formal Engineering Methods (ICFEM'09), LNCS, Volume 5885, Pages 679-697, Rio de Janeiro, Brazil, December 2009.
11. 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), Pages 319-328, Los Angeles, CA, USA, August 2009.
12. 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, Volume 5556, Pages 43-54, Rhodes, Greece, July 2009.
13. 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, Volume 5457, Pages 152-163, Tarragona, Spain, April 2009.
14. 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), Pages 55-64, Saint Malo, France, September 2008.
15. Ch. Baier, N. Bertrand, P. Bouyer, Th. Brihaye, M. 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), Pages 217-226, Pittsburgh, PA, USA, June 2008.
16. Ch. Baier, N. Bertrand, M. 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), LNCS, Volume 4962, Pages 287-301, Budapest, Hungary, March 2008.
17. 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.), Lecture Notes in Computer Science, Volume 4855, Pages 1529-3785, New Delhi, India, December 2007.
18. 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.), Lecture Notes in Computer Science, Volume 4229, Pages 212-227, Paris, France, September 2006.
19. 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.), Electronic Notes in Theoretical Computer Science, Volume 154, Pages 59-69, San Francisco, CA, USA, July 2006.
20. 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, April 2004.
21. 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), Andrew D. Gordon (ed.), Lecture Notes in Computer Science, Volume 2620, Pages 120-135, Warsaw, Poland, April 2003.

Research Reports

1. Nathalie Bertrand, Thierry Jéron, Amélie Stainer, Moez Krichen. Research Report INRIA, No 7501, 2011.
2. N. Bertrand, A. Stainer, T. Jéron, M. Krichen. A game approach to determinize timed automata. Research Report INRIA, No 7381, October 2010.
3. 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, April 2008.

Misc

1. Ch. Baier, N. Bertrand, M. Grösser. The Effect of Tossing Coins in Omega-Automata. Proceedings of the 20th International Conference on Concurrency Theory (CONCUR'09), pp. 15-29, 2009.

Thesis

1. N. Bertrand. Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones et techniques de vérification automatique. PhD Thesis Laboratoire Spécification et Vérification, ENS Cachan, France, September 2006.

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 is automatically generated by bib2html v216, © INRIA 2002-2007, Projet Lagadic