Publications of Anne Bouillard

Load the BibTeX file

Academic Journals

1. Anne Bouillard, Bruno Gaujal. Backward Coupling in Bounded Free-Choice Nets Under Markovian and Non-Markovian Assumptions. Journal of Discrete Event Dynamamic Systems (JDEDS), 18(4):473-498, 2008.
2. Anne Bouillard, Bruno Gaujal, Sébastien Lagrange, Éric Thierry. Optimal routing for end-to-end guarantees using Network Calculus. Performance Evaluation, 65(11):883-906, 2008.
3. Anne Bouillard, Éric Thierry. An Algorithmic Toolbox for Network Calculus. Journal of Discrete Event Dynamic Systems (JDEDS), 18(1):3-49, 2008.
4. A. Bouillard, E. Thierry. An Algorithmic Toolbox for Network Calculus. Journal of Discrete Event Dynamical Systems, 18(1), 2007.
5. A. Bouillard, B. Gaujal, J. Mairesse. Extremal throughputs in free-choice nets. Journal of Discrete Event Dynamic Systems, 16(3):327-352, September 2006.
6. A. Bouillard, J. Mairesse. Möbius inversion formula for the trace group. C. R. Acad. Sci. Paris, Ser I, 339:899-904, 2004.

International Conferences

1. Anne Bouillard, Aurore Junier. Worst-case delay bounds with fixed priorities using network calculus. In Proc. of Valuetools'2011, 2011.
2. Anne Bouillard, Laurent Jouhet, \'E Thierry.. Comparison of Different Classes of Service Curves in Network Calculus. In International Workshop on Discrete Event Systems (WODES 2010), 2010.
3. Anne Bouillard, Laurent Jouhet, \'E Thierry.. Tight performance bounds in the worst-case analysis of feed-forward networks. In IEEE Conference on Computer Communications (INFOCOM 2010), 2010.
4. Anne Bouillard, Linh T.X. Phan, Samarjit Chakraborty. Lightweight Modeling of Complex State Dependencies in Stream-Processing Systems. In 15th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), 2009.
5. Anne Bouillard, Sidney Rosario, Albert Benveniste, Stefan Haar. Monotonicity in Service Orchestrations. In Petri Nets, Lecture Notes in Computer Science, Volume 5606, Pages 263-282, 2009.
6. Anne Bouillard, Stefan Haar, Sidney Rosario. Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net. In FORMATS, Jo\"e Ouaknine, Frits W. Vaandrager (eds.), Lecture Notes in Computer Science, Volume 5813, 2009.
7. Marc Boyer, Laurent Jouhet, Anne Bouillard. Notations pour le calcul réseau. In Modélisation des systèmes réactifs (MSR), 2009.
8. Anne Bouillard, Bertrand Cottenceau, Bruno Gaujal, Laurent Hardouin, Sébastien Lagrange, Mehdi Lhommeau, Eric Thierry. COINC Library: a toolbox for the Network Calculus. In Fourth International Conference on Performance Evaluation Methodologies and Tools (ValueTools), 2009.
9. Anne Bouillard, Laurent Jouhet, Éric Thierry. Computation of a (min,+) multi-dimensional convolution for end-to-end performance analysis. In 3rd international conference on Performance Evaluation Methodologies and Tools (ValueTools 2008), Athens, Greece, October 2008.
10. A. Bouillard, B. Gaujal, S. Lagrange, E. Thierry. Optimal routing for end-to-end guarantees: the price of multiplexing. In VALUETOOLS, 2007.
11. Anne Bouillard, Bruno Gaujal. Backward coupling in Petri nets. In VALUETOOLS, Pages 0-0, 2006.
12. A. Bouillard, B. Gaujal, J. Mairesse. Extremal throughputs in free-choice nets. In 26th International Conference On Application and Theory of Petri Nets and Other Models of Concurrency, G. Ciardo, P. Darondeau (eds.), LNCS, Pages 108-127, 2005.
13. A. Bouillard, B Gaujal, J. Mairesse. Throughput in stochastic free-choice nets under various policies. In Joint 44th IEEE Conference on Decision and Control and European Control Conference, 2005.
14. A. Bouillard, J. Mairesse. Generating series of the trace group. In Developments in Language Theory, Z. Ésik, Z. Fülöp (eds.), LNCS, Volume 2710, Pages 159-170, 2003.
15. A. Bouillard, B. Gaujal. Coupling time of a (max,plus) matrix. In Workshop on Max-Plus Algebras and Their Applications to Discrete-event Systems, Theoretical Computer Science, and Optimization, Pages 235-240, 2001.

Research Reports

1. Anne Bouillard, Stefan Haar, Sidney Rosario. Critical paths in the Partial Order Unfolding of a Stochastic Petri Net. Research Report INRIA, No 7003, 2009.
2. Anne Bouillard, Laurent Jouhet, Eric Thierry. Tight performance bounds in the worst-case analysis of feed-forward networks. Research Report INRIA, No 7012, 2009.
3. Anne Bouillard, Sidney Rosario, Albert Benveniste, Stefan Haar. Monotonicity in Service Orchestrations. INRIA Research Report INRIA, No 0, 2008.
4. A. Bouillard, C.S. Chang. An Explicit Control Algorithm for Optical FIFO Queues. Research Report INRIA Research Report RR-6097, 2007.
5. A. Bouillard, E. Thierry. An Algorithmic Toolbox for Network Calculus. Research Report INRIA Research Report RR-6094, 2007.
6. A. Bouillard, E. Thierry. Some examples and counterexamples for (min,+) filtering operations. Research Report INRIA Research Report RR-6095, 2007.
7. A. Bouillard, B. Gaujal. Perfect Sampling for Fork-Join networks. Research Report LIP, No 0, 2005.
8. A. Bouillard, B. Gaujal, J. Mairesse. Extremal throughputs in free-choice nets. Research Report LIP, No 14, 2005.

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 v210, © INRIA 2002-2006, Projet Lagadic