Olivier Bournez

Journals and book chapters:

J.16. "A Survey On Continuous Time Computations"
Olivier Bournez and Manuel Campagnolo. ( download .ps.gz or download .pdf ).
To appear as a chapter of the book "New Computational Paradigms, Changing Conceptions of What is Computable", eds. S.B. Cooper, B. Löwe, A. Sorbi, Springer, New York 2008. bibitem.
J.15. "Polynomial differential equations compute all real computable functions on computable compact intervals"
Olivier Bournez, Manuel Campagnolo, Daniel Graça and Emmanuel Hainry. ( Elsevier's Link, download .ps.gz or download .pdf ).
Journal of Complexity 2007, 23 (3): 317--35, June 2007. bibitem.
J.14. "Recursive Analysis Characterized as a Class of Real Recursive Functions"
Olivier Bournez and Emmanuel Hainry. ( download .ps.gz or download .pdf ).
Fundamenta Informatica, 74 (4): 409-433, December 2006. bibitem.
J.13. "Implicit Complexity Over an Arbitrary Structure: Quantifier Alternation"
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois and Jean-Yves Marion. ( Elsevier's Link, download .ps.gz or download .pdf ).
Information and Computation, 204 (2): 210-230, February 2006. bibitem.
J.12. "How much can analog and hybrid systems be proved (super-)Turing"
Olivier Bournez ( Elsevier's Link, download .ps.gz or download .pdf ).
To Appear in Applied Mathematics and Computation. 2006. bibitem.
J.11. "Elementarily Computable Functions Over the Real Numbers and R-Sub-Recursive Functions"
Olivier Bournez and Emmanuel Hainry ( Elsevier's Link, download .ps.gz or download .pdf ).
Theoretical Computer Science, 348 (2-3):130--147, December 2005. bibitem.
J.10. "Implicit Complexity Over an Arbitrary Structure: Sequential and Parallel Polynomial Time."
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois and Jean-Yves Marion. ( Oxford's Link, download .ps.gz or download .pdf ).
Journal of Logic and Computation. 15(1):41-58, 2005. bibitem.
J.09. "The mortality problem for matrices of low dimensions."
Olivier Bournez and Michael S. Branicky. ( Springer's Link, download .ps.gz or download .pdf ).
Theory of Computing Systems, 35(4):433-448, 2002. bibitem.
J.08. "The stability of saturated linear dynamical systems is undecidable."
Vincent D. Blondel, Olivier Bournez, Pascal Koiran and John Tsitsiklis. ( Springer's Link, download .ps.gz or download .pdf ).
Journal of Computer and System Science, 62(3):442--462, May 2001. bibitem.
J.07. "Deciding Stability and Mortality of Piecewise Affine Dynamical Systems."
Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos Papadimitriou and John Tsitsiklis. ( Elsevier's Link, download .ps.gz or download .pdf ).
Theoretical Computer Science. 255: (1-2): 687-696, 2001. bibitem.
J.06. "Effective Synthesis of Switching Controllers for Linear Systems".
Eugene Asarin, Olivier Bournez, Thao Dang, Oded Maler and Amir Pnueli. ( download .ps.gz or download .pdf ).
Proceedings of the IEEE, Special Issue on "Hybrid Systems". 88(7): 1011-1025, July 2000. bibitem.
J.05. "Achilles and the Tortoise Climbing Up the Hyper-arithmetical Hiearchy"
Olivier Bournez. ( download .ps.gz or download .pdf ).
Theoretical Computer Science, 210 (1): 21-71, January 6th 1999. bibitem.
J.04. "Some Bounds on the Computational Power of Piecewise Constant Derivative Systems"
Olivier Bournez. ( Springer's Link, download .ps.gz or download .pdf ).
Theory of Computing Systems, 32(1): 35-67, 1999. bibitem.
J.03. "On matrix mortality in low dimensions"
Olivier Bournez and Michael Branicky ( download .ps.gz or download .pdf ).
Chapter of the book "Open Problems in Mathematical Systems Theory and Control"
Springer-Verlag 1998, V. Blondel, E. Sontag, M. Vidyasagar , J. Willems, Eds. Also presented at the 37th Conference on Decision and Control, Tampa (Florida), in "Open Problem Session". December 16-18, 1998. bibitem.
J.02. "Using local planar geometric invariants to match and model images of line segments"
Patrick Gros, Olivier Bournez and Edmond Boyer ( Springer's Link, download .ps.gz or download .pdf ).
Computer Vision and Image Understanding :CVIU 69 (2) : 135-155, February 1998. bibitem.
J.01. "On the computational power of dynamical systems and hybrid systems"
Olivier Bournez and Michel Cosnard ( Elsevier's Link, download .ps.gz or download .pdf ).
Theoretical Computer Science 168 (2) :417-459, November 1996. bibitem.

Conferences:

C.26. "On the Computational Capabilities of Several Models"
Olivier Bournez, and Emmanuel Hainry. ( or ).
Machines, Computations and Universality Orléans, September 10-13, 2007.
Volume 4664 of Lecture Notes in Computer Science, Springer-Verlag, 2007. bibitem.
C.25. "The General Purpose Analog Computer and Computable Analysis are Two Equivalent Paradigms of Analog Computation"
Olivier Bournez, Manuel L. Campagnolo, Daniel S. Graça and Emmanuel Hainry. ( download .ps.gz or ).
Theory and Applications of Models of Computation Beijing, China, May 15-20th, 2006.
Volume 3959 of Lecture Notes in Computer Science, Springer-Verlag, 2006. bibitem.
C.24. "Proving Positive Almost Sure Termination Under Strategies"
Olivier Bournez and Florent Garnier ( download .ps.gz or ).
Rewriting Techniques and Applications (RTA'2006) Seattle, WA, USA, August 12-14, 2006
Volume 4098 of Lecture Notes in Computer Science, Springer-Verlag, 2006. bibitem.
C.23. "Logical Characterizations of P and NP over an Arbitrary Structure K"
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, and Jean-Yves Marion. ( or ).
3rd APPSEM II Workshop (APPSEM'05), Frauenchiemsee, Germany, 2005.
Also accepted for presentation at "New Computational Paradigms, CiE 2005 Workshop". bibitem.
C.22. "From Chemical Rules to Term Rewriting"
Olivier Bournez, Liliana Ibanescu, Hélène Kirchner. ( download .ps.gz or download .pdf ).
6th International Workshop on Rule-Based Programming (RULE'2005) Nara, Japan, April 23, 2005. bibitem.
C.21. "Proving Positive Almost-Sure Termination"
Olivier Bournez and Florent Garnier. ( Springer's Link, download .ps.gz or download .pdf ).
16th International Conference on Rewriting Techniques and Applications (RTA'2005) Nara, Japan, April 19-21, 2005.
Volume 3467 of Lecture Notes in Computer Science, Springer-Verlag, 2005. bibitem.
C.20. "Real Recursive Functions and Real Extensions of Recursive Functions"
Olivier Bournez and Emmanuel Hainry. ( Springer's Link, download .ps.gz or download .pdf ).
Machines, Computations and Universality, (MCU'2004) Saint-Petersburg, Russia September 21-26, 2004.
Volume 3354 of Lecture Notes in Computer Science, Springer-Verlag, 2004. bibitem.
C.19. "Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures"
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois, and Jean-Yves Marion. ( download .ps.gz or download .pdf ).
Theoretical Computer Science (TCS'2004) Toulouse, France, August 2004.
Also presented in 2nd APPSEM II Workshop (APPSEM'04), Tallin, Estonia, 2004. bibitem et bibitem.
C.18. "An Analog Characterization of Elementarily Computable Functions Over the Real Numbers"
Olivier Bournez and Emmanuel Hainry. ( Springer's Link, download .ps.gz or download .pdf ).
International Colloquium on Automata Languages and Programming (ICALP'2004) Turku, Finland, July 2004.
Volume 3142 of Lecture Notes in Computer Science, Springer-Verlag, 2004.
Also presented in 2nd APPSEM II Workshop (APPSEM'04), Tallin, Estonia, 2004. bibitem et bibitem.
C.17. "Safe Recursion over an Arbitrary Structure: Deterministic Polynomial Time"
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois and Jean-Yves Marion. ( Springer's Link, download .ps.gz or download .pdf ).
Foundations of Software Science and Computation Structures (FOSSACS'03) 2003.
Volume 2620 of Lecture Notes in Computer Science, Springer-Verlag, 2003. bibitem.
C.16. "Safe Recursion over an Arbitrary Structure: PAR, PH and DPH"
Olivier Bournez, Felipe Cucker, Paulin Jacobé de Naurois and Jean-Yves Marion. ( download .ps.gz or download .pdf ).
Fifth International Workshop on Implicit Computational Complexity (ICC'03). 2003.
Volume 90 of Electronic Notes in Theoretical Computer Science, 2003. bibitem.
C.15. "Rewriting Logic and Probabilities"
Olivier Bournez and Mathieu Hoyrup. ( Springer's Link, download .ps.gz or download .pdf ).
Rewriting Techniques and Applications, (RTA'2003). 2003
Volume 2706 of Lecture Notes in Computer Science, Springer-Verlag, 2003. bibitem.
C.14. "A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms"
Olivier Bournez, Guy-Marie Come, Valérie Conraud, Mariana-Liliana Ibanescu and Hélène Kirchner. ( Springer's Link, download .ps.gz or download .pdf ).
Rewriting Techniques and Applications, (RTA'2003). 2003
Volume 2706 of Lecture Notes in Computer Science, Springer-Verlag, 2003. bibitem.
C.13. "Automated generation of kinetic chemical mechanisms using rewriting"
Olivier Bournez, Guy-Marie Come, Valérie Conraud, Mariana-Liliana Ibanescu and Hélène Kirchner. ( Springer's Link, download .ps.gz or download .pdf ).
International Conference on Computational Science. (ICCS'2003). 2003.
Volume 2659 of Lecture Notes in Computer Science, Springer-Verlag, 2003. bibitem.
C.12. "The QSL Plateform at LORIA"
Olivier Bournez, Mohamed El Habib, Claude Kirchner, Hélène Kirchner, Jean-Yves Marion and Stephan Merz. ( download .ps.gz or download .pdf ).
First QPQ Workshop on Deductive Software Components. 2003.
CADE-19 Workshop, Miami, Florida, 2003. bibitem.
C.11. "Probabilistic rewrite strategies. Applications to ELAN."
Olivier Bournez and Claude Kirchner. ( Springer's Link, download .ps.gz or download .pdf ).
Rewriting Techniques and Applications (RTA'2002). 2002.
Volume 2378 of Lecture Notes in Computer Science, pages 252--266, Springer-Verlag, 2002. bibitem.
C.10. "Safe recursion and calculus over an arbitrary structure"
Olivier Bournez, Paulin Jacobé de Naurois and Jean-Yves Marion. ( download .ps.gz or download .pdf ).
Implicit Computational Complexity (ICC'2002). Copenhagen, Danemark, July 2002. bibitem.
C.09. "A Generalization of Equational Proof Theory?"
Olivier Bournez. ( Springer's Link, download .ps.gz or download .pdf ).
2nd Joint International Workshop on Process Algebra and Performance Modelling and Probabilistic Methods in Verification (PAPM-Probmiv'2002). 2002.
Volume 2399 of Lecture Notes in Computer Science, pages 208--209, Springer-Verlag, 2002. bibitem.
C.08. "Verification of Timed Automata Using Rewrite Rules and Strategies"
Emmanuel Beffara, Olivier Bournez, Hassen Kacem and Claude Kirchner. ( download .ps.gz or download .pdf ).
Bar-Ilan International Symposium on the Foundations of Artificial Intelligence (BISFAI'01). 2001. bibitem.
C.07. "Verification of Timed Automata Using Rewrite Rules and Strategies"
Emmanuel Beffara, Olivier Bournez, Hassen Kacem and Claude Kirchner. ( download .ps.gz or download .pdf ).
Sixth Annual Workshop of the ERCIM Working Group on Constraints. 2001. bibitem.
C.06. "On the representation of Timed Polyhedra"
Olivier Bournez and Oded Maler. ( Springer's Link, download .ps.gz or download .pdf ).
International Colloquium on Automata Languages and Programming (ICALP'2000). Geneva, Switzerland. July 9-15 2000.
Volume 1853 of Lecture Notes in Computer Science, pages 793--807, Springer-Verlag, 2000. bibitem.
C.05. "Approximate reachability analysis of piecewise-linear dynamical systems".
Eugene Asarin, Olivier Bournez, Thao Dang and Oded Maler. ( Springer's Link, download .ps.gz or download .pdf ).
Hybrid Systems: Computation and Control (HSCC'00). Pittsburgh, USA, March 23-25 2000
Volume 1790 of Lecture Notes in Computer Science, pages 20--31, Springer-Verlag, 2000. bibitem.
C.04. "The stability of saturated linear dynamical systems is undecidable".
Vincent Blondel, Olivier Bournez, Pascal Koiran and John Tsitsiklis. ( Springer's Link, download .ps.gz or download .pdf ).
Symposium on Theoretical Aspects of Computer Science (STACS'2000). Lille, France, February 17-19 2000.
Volume 1770 of Lecture Notes in Computer Science, pages 479-490, Springer-Verlag, 2000. bibitem.
C.03. "Orthogonal Polyhedra: Representation and Computation."
Olivier Bournez, Oded Maler and Amir Pnueli. ( Springer's Link, download .ps.gz or download .pdf ).
Hybrid Systems: Computation and Control (HSCC'99). Nijmegen, The Netherlands, March 29-31 1999.
Volume 1569 of Lecture Notes in Computer Science, pages 46--60, Springer-Verlag, 1999. bibitem.
C.02. "Some Bounds on the Computational Power of Piecewise Constant Derivative Systems".
Olivier Bournez. ( , download .ps.gz or download .pdf ).
Automata, Languages and Programming, 24th International Colloquium (ICALP'97). Bologna, Italy, July 7-11 1997
Volume 1256 of Lecture Notes in Computer Science, pages 143--153, Springer-Verlag 1997. bibitem.
C.01. "MORSE: A 3D Object Recognition System Based on Geometric Invariants".
J.L.Mundy, C. Huang, J. Liu, W.Hoffman, D.A.Forsyth, C.A.Rothwell, A. Zisserman, S. Utche and O.Bournez. ( download .ps.gz or download .pdf ).
ARPA Image Understanding Workshop. pages 1393-1402 Monterey (California), November 13-16 1994. bibitem.

Selected Research Reports (related to other works):

"Logique de réécriture probabiliste"
Olivier Bournez, Mathieu Hoyrup, Claude Kirchner. LORIA Research Report. get it
"Symbolic Simulation and Formal Verification of Updatable Timed Automata using a Rewrite System"
Olivier Bournez, Térence Soussan, Bertrand Tavernier. LORIA Research Report. get it
"Fuzzy Equational Theories"
Olivier Bournez. LORIA Research Report. get it
"Termination in finite mean time of a CSMA/CA rule-based model"
Olivier Bournez and Florent Garnier. 2008. Submitted. LORIA Research Report. get it
"A Dynamic Approach for Load Balancing"
Dominique Barth, Olivier Bournez, Octave Boussaton and Johanne Cohen. 2008. Submitted. LORIA Research Report. DOWNLOAD

Theses

"Habilitation: Modèles Continus. Calculs. Algorithmique Distribuée " (ENGLISH TRANSLATION HERE)
Olivier Bournez. Résumé et Téléchargement/ Abstract and download
Habilitation à Diriger les Recherches de l'Institut National Polytechnique de Lorraine, 7 Décembre 2006. bibitem
"PhD Thesis: Complexité Algorithmique des Systèmes Dynamiques Continus et Hybrides "
Olivier Bournez. Résumé et Téléchargement/ Abstract and download
Thèse de l'Ecole Normale Supérieure de Lyon, 18 Janvier 1999.bibitem
Page last modified on March 12, 2008, at 04:43 PM