Olivier Bournez

(randomly updated / not up to date)


Continuous Time Models of Computations


Surveys / General Considerations

A Survey on Continuous Time Computations. (full details)
Bournez, Olivier and Campagnolo, Manuel L.
In New Computational Paradigms. Changing Conceptions of What is Computable. (Cooper, S.B. and L{\"o}we, B. and Sorbi, A., Eds.). New York, Springer-Verlag, pages 383-423. 2008. (PDF) (BibTeX)
Towards an Axiomatization of Simple Analog Algorithms. (full details)
Bournez, Olivier , Dershowitz, Nachum and Falkovich, Evgenia
In Theory and Applications of Models of Computation - 9th Annual Conference, TAMC 2012, Beijing, China, May 16-21, 2012. Proceedings. (Agrawal, Manindra and Cooper, S. Barry and Li, Angsheng, Eds.) Volume 7287 of Lecture Notes in Computer Science. Spinger-Verlag, pages 525-536. 2012. (BibTeX)
Axiomatizing Analog Algorithms. (full details)
Bournez, Olivier , Dershowitz, Nachum and N{\'{e}}ron, Pierre
In Pursuit of the Universal - 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016, Proceedings. (Beckmann, Arnold and Bienvenu, Laurent and Jonoska, Natasa, Eds.) Volume 9709 of Lecture Notes in Computer Science. Springer, pages 215-224. 2016. (PUBLISHER URL) (PDF) (BibTeX)

General Purpose Analog Computer / Ordinary Differential Equations with Polynomial Right-hand Side

A Universal Ordinary Differential Equation. (full details)
Bournez, Olivier and Pouly, Amaury
In Submitted.. 2017. (PUBLISHER URL) (BibTeX)
Computing with Polynomial Ordinary Differential Equations. (full details)
{Bournez}, O. , {Gra{\c c}a}, D. and {Pouly}, A.
Technical report. 2016. (BibTeX)
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. (full details)
{Bournez}, O. , {Gra{\c c}a}, D.~S. and {Pouly}, A.
Technical report. 2016. (BibTeX)
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. (full details)
Bournez, Olivier , Gra{\c{c}}a, Daniel S. and Pouly, Amaury
Submitted, abs/1601.05360. 2016. (PUBLISHER URL) (BibTeX)
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length. The General Purpose Analog Computer and Computable Analysis are two efficiently equivalent models of computations. (full details)
Bournez, Olivier , Gra{\c{c}}a, Daniel S. and Pouly, Amaury
In 43rd International Colloquium on Automata, Languages, and Programming, {ICALP} 2016, July 11-15, 2016, Rome, Italy. Volume 55 of LIPIcs. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, pages 109:1-109:15. 2016. (PUBLISHER URL) (PDF) (BibTeX)
Rigorous Numerical Computation of Polynomial Differential Equations Over Unbounded Domains. (full details)
Bournez, Olivier , Gra{\c c}a, Daniel and Pouly, Amaury
In Mathematical Aspects of Computer and Information Sciences - 6th International Conference, {MACIS} 2015, Berlin, Germany, November 11-13, 2015, Revised Selected Papers. (Kotsireas, Ilias S. and Rump, Siegfried M. and Yap, Chee K., Eds.) Pages 469-473. 2015. (PUBLISHER URL) (PDF) (BibTeX)
On the Functions Generated by the General Purpose Analog Computer. (full details)
Bournez, Olivier , Gra{\c{c}}a, Daniel S. and Pouly, Amaury
Technical report, Extracted from Chapter 2 of \cite{TheseAmaury}. 2015. (BibTeX)
On the Functions Generated by the General Purpose Analog Computer. (full details)
Bournez, Olivier , Gra{\c{c}}a, Daniel S. and Pouly, Amaury
Technical report, Extracted from Chapter 2 of \cite{TheseAmaury}. 2015. (BibTeX)
Turing Machines Can Be Efficiently Simulated by the General Purpose Analog Computer. (full details)
Bournez, Olivier , Gra\c{c}a, Daniel S. and Pouly, Amaury
In Theory and Applications of Models of Computation, 10th International Conference, TAMC 2013, Hong Kong, China, May 20-22, 2013. Proceedings (TAMC'2013). Springer, pages 169-180. 2013. (BibTeX)
Computability and computational complexity of the evolution of nonlinear dynamical systems. (full details)
Bournez, Olivier , Gra{\c c}a, Daniel S. , Pouly, Amaury and Zhong, Ning
In Computability in Europe (CIE'2013). (Springer, Eds.) Lecture Notes in Computer Science. 2013. (BibTeX)
On the complexity of solving polynomial initial value problems. (full details)
Olivier Bournez, Daniel Gra{\c c}a, Amaury Pouly
In International Symposium on Symbolic and Algebraic Computation (ISSAC'12).. 2012. (BibTeX)
Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains. (full details)
Olivier Bournez, Daniel Gra{\~A}{\S}a, Amaury Pouly
In Mathematical Foundations of Computer Science, MFCS'11. Volume 6907 of Lecture Notes in Computer Science, pages 170-181. 2011. (BibTeX)

R-Recursive Functions

Algebraic Characterizations of Complexity-Theoretic Classes of Real Functions. (full details)
Bournez, Olivier , Gomaa, Walid and Hainry, Emmanuel
IJUC, 7(5):331-351. 2011. (BibTeX)
Implicit complexity in recursive analysis. (full details)
Olivier Bournez, Walid Gomaa and Hainry, Emmanuel
In Logic and Computational Complexity.. 2009. (BibTeX)
Characterizing algebraically computable and polynomial time functions over the reals. (full details)
Bournez, Olivier , Gomaa, Walid and Hainry, Emmanuel
In Submitted... 2009. (PDF) (BibTeX)
Elementarily Computable Functions Over the Real Numbers and $\mathbbR$-Sub-Recursive Functions. (full details)
Bournez, Olivier and Hainry, Emmanuel
Theoretical Computer Science, 348(2--3):130-147. 2005. (PUBLISHER URL) (PDF) (BibTeX)

Computations and Dynamical Systems


Complexity of questions related to dynamical systems

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
{Bazille}, H. , {Bournez}, O. , {Gomaa}, W. and {Pouly}, A.
Theoretical Computer Science. 2016, To appear. (PDF) (BibTeX)
Computing with polynomial ordinary differential equations. (full details)
Bournez, Olivier , Gra{\c c}a, Daniel and Pouly, Amaury
Journal of Complexity, 36:106 - 140. 2016. (PUBLISHER URL) (PDF) (BibTeX)
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
{Bazille}, H. , {Bournez}, O. , {Gomaa}, W. and {Pouly}, A.
Technical report. 2016. (BibTeX)
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
{Bazille}, H. , {Bournez}, O. , {Gomaa}, W. and {Pouly}, A.
Technical report. 2016. (BibTeX)
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
Bazille, Hugo , Bournez, Olivier , Gomaa, Walid and Pouly, Amaury
In Reachability Problems - 8th International Workshop, {RP} 2014, Oxford, UK, September 22-24, 2014. Proceedings. Volume 8762 of Lecture Notes in Computer Science. Springer, pages 20-31. 2014. (PUBLISHER URL) (BibTeX)
Computability and computational complexity of the evolution of nonlinear dynamical systems. (full details)
Bournez, Olivier , Gra{\c c}a, Daniel S. , Pouly, Amaury and Zhong, Ning
In Computability in Europe (CIE'2013). (Springer, Eds.) Lecture Notes in Computer Science. 2013. (BibTeX)
On the complexity of solving polynomial initial value problems. (full details)
Olivier Bournez, Daniel Gra{\c c}a, Amaury Pouly
In International Symposium on Symbolic and Algebraic Computation (ISSAC'12).. 2012. (BibTeX)
The Mortality Problem for Matrices of Low Dimensions. (full details)
Bournez, Olivier and Branicky, Michael
Theory of Computing Systems, 35(4):433-448. 2002. (PUBLISHER URL) (PDF) (BibTeX)
Deciding Stability and Mortality of Piecewise Affine Dynamical Systems. (full details)
Blondel, Vincent , Bournez, Olivier , Koiran, Pascal , Papadimitriou, Christos and Tsitsiklis, John
Theoretical Computer Science A, 1--2(255):687-696. 2001. (PUBLISHER URL) (PDF) (BibTeX)
The stability of saturated linear dynamical systems is undecidable. (full details)
Blondel, Vincent D. , Bournez, Olivier , Koiran, Pascal and Tsitsiklis, John
Journal of Computer and System Science, 62(3):442-462. 2001. (PUBLISHER URL) (PDF) (BibTeX)
The stability of saturated linear dynamical systems is undecidable. (full details)
Blondel, Vincent D. , Bournez, Olivier , Koiran, Pascal and Tsitsiklis, John N.
In {Symposium on Theoretical Aspects of Computer Science (STACS), Lille, France}. Feb. (Tison, Horst Reichel Sophie, Eds.) Volume 1770 of Lecture Notes in Computer Science. Springer-Verlag, pages 479-490. 2000. (PUBLISHER URL) (PDF) (BibTeX)
On matrix mortality in low dimensions. (full details)
Bournez, Olivier and Branicky, Michael B.
In Open Problems in Mathematical Systems and Control Theory. (Blondel, V. D. and Sontag, E. D. and Vidyasagar, M. and Willems, J. C., Eds.), Springer-Verlag, London, pages 67-70. 1998. (PDF) (BibTeX)

Dynamical Systems and Computations

Computation with perturbed dynamical systems. (full details)
Bournez, Olivier , Gra\c{c}a, Daniel S. and Hainry, Emmanuel
Journal of Computer System Science, 79(5):714-724. 2013. (BibTeX)
Robust Computations with Dynamical Systems. (full details)
Bournez, Olivier , Gra\c{c}a, Daniel S. and Hainry, Emmanuel
In Mathematical Foundations of Computer Science, MFCS'2010. Volume 6281 of Lecture Notes in Computer Science. Springer, pages 198-208. 2010. (PUBLISHER URL) (BibTeX)
How much can analog and hybrid systems be proved (super-)Turing. (full details)
Bournez, Olivier
Applied Mathematics and Computation, 178(1):58-71. 2006. (PUBLISHER URL) (PDF) (BibTeX)
Some bounds on the computational power of Piecewise Constant Derivative systems. (full details)
Bournez, Olivier
Theory of Computing Systems, 32(1):35-67. 1999. (PDF) (BibTeX)
Achilles and the Tortoise climbing up the hyper-arithmetical hierarchy. (full details)
Bournez, Olivier
Theoretical Computer Science, 210(1):21-71. 1999. (PDF) (BibTeX)
Some Bounds on the Computational Power of Piecewise Constant Derivative Systems. (full details)
Bournez, O.
In Automata, Languages and Programming, 24th International Colloquium (ICALP'97). Bologne, Italie, {7--11~} # jul. (Degano, Pierpaolo and Gorrieri, Robert and Marchetti-Spaccamela, Alberto, Eds.) Volume 1256 of Lecture Notes in Computer Science. Springer-Verlag, pages 143-153. 1997. (PDF) (BibTeX)
On the computational power of dynamical systems and hybrid systems. (full details)
Bournez, Olivier and Cosnard, Michel
Theoretical Computer Science, 168(2):417-459. 1996. (PUBLISHER URL) (PDF) (BibTeX)

Distributed Computing


Population Protocols and variants

Homonym Population Protocols. (full details)
Bournez, Olivier , Cohen, Johanne and Rabie, Mika{\"e}l
In Networked Systems. Third International Conference, NETYS 2015, Agadir, Morocco, May 13-15, 2015, Revised Selected Papers. (Springer, Eds.) Volume 9466 of Lecture Notes in Computer Science. 2015. (PUBLISHER URL) (BibTeX)
Population Protocols on Graphs: A Hierarchy. (full details)
Bournez, Olivier and Lef{\`e}vre, Jonas
In Unconventional Computation \& Natural Computation 2013 ((UCNC'2013). (Springer, Eds.) Lecture Notes in Computer Science. 2013. (BibTeX)
Trustful Population Protocols. (full details)
Bournez, Olivier , Lef{\`e}vre, Jonas and Rabie, Mika{\"e}l
In International Symposium on Distributed Computing (DISC'2013).. 2013. (BibTeX)
Population Protocols on Graphs: A Hierarchy. (full details)
Bournez, Olivier and Lef{\`e}vre, Jonas
In Spatial Computing Workship (SCW'2013).. 2013. (BibTeX)
Population Protocols that Correspond to Symmetric Games. (full details)
Bournez, Olivier , Chalopin, J{\'e}r{\'e}mie , Cohen, Johanne , Koegler, Xavier and Mika{\"e}l, Rabie
International Journal of Unconventional Computation, 9(1--2):5-36. 2013. (BibTeX)
Computing with Pavlovian Populations. (full details)
Bournez, Olivier , Chalopin, J{\'e}r{\'e}mie , Cohen, Johanne , Koegler, Xavier and Rabie, Mika{\"e}l
In Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings. Volume 7109 of Lecture Notes in Computer Science. Springer, pages 409-420. 2011. (BibTeX)
Playing With Population Protocols. (full details)
Bournez, Olivier , Chalopin, J{\'e}r{\'e}mie , Cohen, Johanne and Koegler, Xavier
In The Complexity of a Simple Program. Cork, Irland, December 6-7th. 2008. (PDF) (BibTeX)

Computing with Large Populations

Computing with Large Populations Using Interactions. (full details)
Bournez, Olivier , Fraigniaud, Pierre and Koegler, Xavier
In Mathematical Foundations of Computer Science, MFCS'12. Lecture Notes in Computer Science. Spinger-Verlag. 2012. (BibTeX)
Computing with Large Populations. (full details)
Olivier Bournez, Pierre Fraigniaud, Xavier Koegler
In Submitted... 2011. (BibTeX)
On the Number of Binary-Minded Individuals Required To Compute $\sqrt\frac12$. (full details)
Aupy, Guillaume and Bournez, Olivier
Theoretical Computer Science, 411(22):2262-2267. 2011. (PUBLISHER URL) (BibTeX)
On the Convergence of Population Protocols When Population Goes to Infinity. (full details)
Bournez, Olivier , Chassaing, Philippe , Cohen, Johanne , Gerin, Lucas and Koegler, Xavier
Applied Mathematics and Computation, 215(4):1340-1350. 2009. (PDF) (BibTeX)
On the Convergence of a Population Protocol When Population Goes to Infinity. (full details)
Bournez, Olivier , Chassaing, Philippe , Cohen, Johanne , Gerin, Lucas and Koegler, Xavier
In Physics and Computations, Worshop of Unconventional Computation 2008, UC 2008. Vienna, Austria, August 25-28. 2008. (PDF) (BibTeX)

Learning in Games / Algorithmic Game Theory


Games and Distributed algorithms

Computing with Pavlovian Populations. (full details)
Bournez, Olivier , Chalopin, J{\'e}r{\'e}mie , Cohen, Johanne , Koegler, Xavier and Rabie, Mika{\"e}l
In Principles of Distributed Systems - 15th International Conference, OPODIS 2011, Toulouse, France, December 13-16, 2011. Proceedings. Volume 7109 of Lecture Notes in Computer Science. Springer, pages 409-420. 2011. (BibTeX)

Distributed Learning in games

Learning Equilibria in Games by Stochastic Distributed Algorithms. (full details)
Bournez, Olivier and Cohen, Johanne
In Computer and Information Sciences III, pages 31-38. . Springer London. 2013. (PUBLISHER URL) (BibTeX)
A Dynamic Approach for Load Balancing. (full details)
Barth, Dominique , Bournez, Olivier , Boussaton, Octave and Cohen, Johanne
In GameComm'09, 3rd ICST/ACM International Workshop on Game Theory in Communication Networks. Pisa, Italy, October. 2009. (BibTeX)
Distributed Learning of Equilibria in a Routing Game. (full details)
Barth, Dominique , Bournez, Olivier , Boussaton, Octave and Cohen, Johanne
Parallel Processing Letters, 19:189-204. 2009. (PUBLISHER URL) (PDF) (BibTeX)
Distributed Learning of Wardrop Equilibria. (full details)
Barth, Dominique , Bournez, Olivier , Boussaton, Octave and Cohen, Johanne
In Unconventional Computation 2008, UC 2008. Vienna, Austria, August 25-28. Volume 5204 of Lecture Notes in Computer Science. Springer, pages 19-32. 2008. (PUBLISHER URL) (PDF) (BibTeX)
Convergences et dynamiques du routage dans les r\'eseaux. (full details)
Barth, D. , Bournez, O. , Boussaton, O. and Cohen, J.
In Journ{\'e}es P{\^o}le ResCom. September. 2007. (BibTeX)

Blum Shub Smale Model of Computation:


Implicit Complexity over an Arbitrary Structure: Quantifier Alternations. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
Information and Computation, 202(2):210-230. 2006. (PUBLISHER URL) (PDF) (BibTeX)
Logical Characterizations of $P_\mathcalK$ and $NP_\mathcalK$ Over an Arbitrary Structure $K$. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In 3rd APPSEM II Workshop (APPSEM'05), Frauenchiemsee, Germany, 2005. Also accepted for presentation at \textit{CIE 2005: New Computational Paradigms.}.. 2005. (BibTeX)
Implicit Complexity over an Arbitrary Structure: Sequential and Parallel Polynomial Time. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
Journal of Logic and Computation, 15(1):41-58. 2005. (PUBLISHER URL) (PDF) (BibTeX)
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In 3rd IFIP International Conference on Theoretical Computer Science - TCS'2004. Toulouse, France, august. Kluwer Academic Press. 2004. (PDF) (BibTeX)
Tailoring Recursion to Characterize Non-Deterministic Complexity Classes Over Arbitrary Structures. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In In 2nd APPSEM II Workshop (APPSEM'04). April. 2004. (BibTeX)
Computability over an Arbitrary Structure. Sequential and Parallel Polynomial Time.. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In Foundations of Software Science and Computational Structures, 6th International Conference (FOSSACS'2003). Warsaw. (Gordon, Andrew D., Eds.) Volume 2620 of Lecture Notes in Computer Science. Springer, pages 185-199. 2003. (BibTeX)
Safe Recursion Over an Arbitrary Structure: PAR, PH and PH. (full details)
Bournez, Olivier , Cucker, Felipe , de Naurois, Paulin Jacob{\'e} and Marion, Jean-Yves
In Fifth International Worshop on Implicit Computational Complexity - ICC'2003. Ottawa, Canada. (Dawar, Anuj, Eds.) Volume 90 of Electronic Notes in Theoretical Computer Science. 2003. (PDF) (BibTeX)
Safe recursion and calculus over an arbitrary structure. (full details)
Bournez, Olivier , de Naurois, Paulin and Marion, Jean-Yves
In Implicit Computational Complexity - ICC'02. Copenhagen, Denmark, July. 2002. (PDF) (BibTeX)

Verification


Frontier between decidability and undecidability in verification

On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
{Bazille}, H. , {Bournez}, O. , {Gomaa}, W. and {Pouly}, A.
Theoretical Computer Science. 2016, To appear. (PDF) (BibTeX)
Computing with polynomial ordinary differential equations. (full details)
Bournez, Olivier , Gra{\c c}a, Daniel and Pouly, Amaury
Journal of Complexity, 36:106 - 140. 2016. (PUBLISHER URL) (PDF) (BibTeX)
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
{Bazille}, H. , {Bournez}, O. , {Gomaa}, W. and {Pouly}, A.
Technical report. 2016. (BibTeX)
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
{Bazille}, H. , {Bournez}, O. , {Gomaa}, W. and {Pouly}, A.
Technical report. 2016. (BibTeX)
On The Complexity of Bounded Time Reachability for Piecewise Affine Systems. (full details)
Bazille, Hugo , Bournez, Olivier , Gomaa, Walid and Pouly, Amaury
In Reachability Problems - 8th International Workshop, {RP} 2014, Oxford, UK, September 22-24, 2014. Proceedings. Volume 8762 of Lecture Notes in Computer Science. Springer, pages 20-31. 2014. (PUBLISHER URL) (BibTeX)
Computability and computational complexity of the evolution of nonlinear dynamical systems. (full details)
Bournez, Olivier , Gra{\c c}a, Daniel S. , Pouly, Amaury and Zhong, Ning
In Computability in Europe (CIE'2013). (Springer, Eds.) Lecture Notes in Computer Science. 2013. (BibTeX)
On the complexity of solving polynomial initial value problems. (full details)
Olivier Bournez, Daniel Gra{\c c}a, Amaury Pouly
In International Symposium on Symbolic and Algebraic Computation (ISSAC'12).. 2012. (BibTeX)
The Mortality Problem for Matrices of Low Dimensions. (full details)
Bournez, Olivier and Branicky, Michael
Theory of Computing Systems, 35(4):433-448. 2002. (PUBLISHER URL) (PDF) (BibTeX)
Deciding Stability and Mortality of Piecewise Affine Dynamical Systems. (full details)
Blondel, Vincent , Bournez, Olivier , Koiran, Pascal , Papadimitriou, Christos and Tsitsiklis, John
Theoretical Computer Science A, 1--2(255):687-696. 2001. (PUBLISHER URL) (PDF) (BibTeX)
The stability of saturated linear dynamical systems is undecidable. (full details)
Blondel, Vincent D. , Bournez, Olivier , Koiran, Pascal and Tsitsiklis, John
Journal of Computer and System Science, 62(3):442-462. 2001. (PUBLISHER URL) (PDF) (BibTeX)
The stability of saturated linear dynamical systems is undecidable. (full details)
Blondel, Vincent D. , Bournez, Olivier , Koiran, Pascal and Tsitsiklis, John N.
In {Symposium on Theoretical Aspects of Computer Science (STACS), Lille, France}. Feb. (Tison, Horst Reichel Sophie, Eds.) Volume 1770 of Lecture Notes in Computer Science. Springer-Verlag, pages 479-490. 2000. (PUBLISHER URL) (PDF) (BibTeX)
On matrix mortality in low dimensions. (full details)
Bournez, Olivier and Branicky, Michael B.
In Open Problems in Mathematical Systems and Control Theory. (Blondel, V. D. and Sontag, E. D. and Vidyasagar, M. and Willems, J. C., Eds.), Springer-Verlag, London, pages 67-70. 1998. (PDF) (BibTeX)

Tools for Verifications/ Model-Checking

The QSL Plateform at LORIA. (full details)
Bournez, Olivier , Habib, Mohamed El , Kirchner, Claude , Kirchner, H{\'e}l{\`e}ne , Marion, Jean-Yves and Merz, Stephan
In First QPQ Workshop on Deductive Software Components. Miami, Florida, July 28, pages 9-12. 2003. (BibTeX)
Effective Synthesis of Switching Controllers for Linear Systems. (full details)
Asarin, Eugene , Bournez, Olivier , Dang, Thao , Maler, Oded and Pnueli, Amir
Proceedings of the IEEE, Special Issue on `Hybrid Systems'', 88(7):1011-1025. 2000. (PDF) (BibTeX)
On the representation of timed polyhedra. (full details)
Bournez, Olivier and Maler, Oded
In International Colloquium on Automata Languages and Programming (ICALP'00). Geneva, Switzerland, {9--15~} # jul. Volume 1853 of Lecture Notes in Computer Science. Springer, pages 793-807. 2000. (PUBLISHER URL) (PDF) (BibTeX)
Approximate reachability analysis of piecewise-linear dynamical systems. (full details)
Asarin, Eugene , Bournez, Olivier , Dang, Thao and Maler, Oded
In {Hybrid Systems\,: Computation and Control (HSCC'00), Pittsburgh (USA)}. March 23-25 2000. Volume 1790 of Lecture Notes in Computer Science. Springer-Verlag, pages 20-31. 2000. (PUBLISHER URL) (PDF) (BibTeX)
Orthogonal polyhedra: Representation and Computation. (full details)
Bournez, Olivier , Maler, Oded and Pnueli, Amir
In Hybrid Systems: Computation and Control - HSCC'99. Nijmegen, Pays-Bas, {29--31} # mar. Volume 1569 of Lecture Notes in Computer Science, pages 46-60. 1999. (PUBLISHER URL) (PDF) (BibTeX)

Programming with rules and strategies / Rewriting


Rewriting with probabilities and fuzzyness

Termination in finite mean time of a CSMA/CA Termination in finite mean time of a CSMA/CA rule-based model. (full details)
Bournez, Olivier and Garnier, Florent
Technical report, LORIA/INRIA. 2008. Get it. (BibTeX)
Termination in finite mean time of a CSMA/CA Termination in finite mean time of a CSMA/CA rule-based model. (full details)
Bournez, Olivier and Garnier, Florent
Technical report, LORIA/INRIA. 2008. Get it. (BibTeX)
Proving Positive Almost Sure Termination Under Strategies. (full details)
Bournez, Olivier and Garnier, Florent
In 17th International Conference on Rewriting Techniques and Applications (RTA'2006). Seattle, WA, USA. (Pfenning, Frank, Eds.) Volume 4098 of Lecture Notes in Computer Science. Springer, pages 357-371. 2006. (PDF) (BibTeX)
Symbolic Simulation and Formal Verification of Updatable Timed Automata. (full details)
Bournez, Olivier , Soussan, Terence , Tavernier, Bertr and
Technical report, LORIA. 2005. Get it. (BibTeX)
Termination in finite mean time of a CSMA/CA rule-based model. (full details)
Bournez, Olivier , Garnier, Florent and Kirchner, Claude
Technical report, LORIA, Nancy. 2005. Get it. (BibTeX)
Proving Positive Almost Sure Termination. (full details)
Bournez, Olivier and Garnier, Florent
In 16th International Conference on Rewriting Techniques and Applications (RTA'2005). Nara, Japan. Volume 3467 of Lecture Notes in Computer Science. Springer, page 323. 2005. (PDF) (BibTeX)
Symbolic Simulation and Formal Verification of Updatable Timed Automata using a Rewrite System. (full details)
Bournez, Olivier , Soussan, T{\'e}rence , Tavernier, Bertr and
Technical report, LORIA. 2004. Get it. (BibTeX)
Fuzzy Equational Theories. (full details)
Bournez, Olivier
Technical report, LORIA. 2003. Get it. (BibTeX)
Rewriting Logic and Probabilities. (full details)
Bournez, Olivier and Hoyrup, Mathieu
In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings. June. (Nieuwenhuis, Robert, Eds.) Volume 2706 of Lecture Notes in Computer Science. Springer, pages 61-75. 2003. (PDF) (BibTeX)
Logique de r\'e\'ecriture probabiliste. (full details)
Bournez, Olivier , Hoyrup, Mathieu and Kirchner, Claude
Technical report, LORIA. 2003. Get it. (BibTeX)
Fuzzy Equational Theories. (full details)
Bournez, Olivier
Technical report, LORIA. 2003. (BibTeX)
Probabilistic rewrite strategies: Applications to ELAN. (full details)
Bournez, Olivier and Kirchner, Claude
In Rewriting Techniques and Applications. jul # {22-24}. (Tison, Sophie, Eds.) Volume 2378 of Lecture Notes in Computer Science. Springer-Verlag, pages 252-266. 2002. (PDF) (BibTeX)
A Generalization of Equational Proof Theory? (full details)
Bournez, Olivier
In Process Algebra and Probabilistic Methods : Performance Modeling and Verification, 2nd Joint International Workshop. jul # {25--26}. (Hermanns, Holger and Segala, Roberto, Eds.) Volume 2399 of Lecture Notes in Computer Science. Springer-Verlag, pages 208-209. 2002. (PDF) (BibTeX)
Verification of timed automata using rewrite rules and strategies. (full details)
Beffara, Emmanuel , Bournez, Olivier , Kacem, Hassen and Kirchner, Claude
In Sixth Annual Workshop of the ERCIM Working Group on Constraints. Prague, jun # {18--20,}. 2001. (PDF) (BibTeX)
Verification of timed automata using rewrite rules and strategies. (full details)
Beffara, Emmanuel , Bournez, Olivier , Kacem, Hassen and Kirchner, Claude
In Proceedings BISFAI 2001, Seventh Biennial Bar-Ilan International Symposium on the Foundations of Artificial Intelligence. Ramat-Gan, Israel, jun # {25--27,}. (Dershowitz, Nachum and Frank, Ariel, Eds.). 2001. (PDF) (BibTeX)

Generating Chemical Rules with Rewriting Rules & Strategies

From Chemical Rules to Term Rewriting. (full details)
Bournez, Olivier , Ibanescu, Liliana and Kirchner, H{\'e}l{\`e}ne
In 6th International Workshop on Rule-Based Programming. Nara, Japan, April. 2005. (BibTeX)
A Rule-Based Approach for Automated Generation of Kinetic Chemical Mechanisms.. (full details)
Bournez, Olivier , C{\^o}me, Guy-Marie , Conraud, Val{\'e}rie , Kirchner, H{\'e}l{\`e}ne and Ibanescu, Liliana
In Rewriting Techniques and Applications, 14th International Conference, RTA 2003, Valencia, Spain, June 9-11, 2003, Proceedings. June. (Nieuwenhuis, Robert, Eds.) Volume 2706 of Lecture Notes in Computer Science. Springer, pages 30-45. 2003. (PUBLISHER URL) (PDF) (BibTeX)
Automated Generation of Kinetic Chemical Mechanisms Using Rewriting. (full details)
Bournez, Olivier , C{\^o}me, Guy-Marie , Conraud, Val{\'e}rie , Kirchner, H{\'e}l{\`e}ne and Ibanescu, Liliana
In International Conference on Computational Science - ICCS 2003, Melbourne, June 2-4, 2003, Proceedings, Part III. (Sloot, P.M.A. and Abramson, D. and Bogdanov, A.V. and Dongarra, J.J. and Zomaya, A.Y. and Gorbachev, Y.E., Eds.) Volume 2659 of Lecture Notes in Computer Science. Springer, pages 367-376. 2003. (PUBLISHER URL) (PDF) (BibTeX)

Computer Vision


Using Local Planar Geometric invariants to Match and Model Images of Line Segments. (full details)
Gros, Patrick , Bournez, Olivier and Boyer, Edmond
Computer Vision and Image Understanding: CVIU, 69(2):135-155. 1998. (PUBLISHER URL) (PDF) (BibTeX)
MORSE: A 3D Object Recognition System Based on Geometric Invariants. (full details)
Mundy, J. , Huang, C. , Liu, J. , Hoffman, W. , Forsyth, D. , Rothwell, C. , Zisserman, A. , Utcke, S. and Bournez, O.
In ARPA Image Understanding Workshop. Monterey (CA), USA, {13--16} # nov, pages 1393-1402. 1994. (PDF) (BibTeX)

Misc:


Teaching documents / Polycopiés

Fondements de l'Informatique: Logique, Mod\~A¨les, Calculs. (full details)
Bournez, Olivier
Ecole Polytechnique. 2014. (BibTeX)
Fondements de l'Informatique: Logique, Mod\~A¨les, Calculs. (full details)
Bournez, Olivier
Ecole Polytechnique. 2011. (BibTeX)
Algorithmes et Complexit\~A\copyright. (full details)
Bournez, Olivier
Ecole Polytechnique. 2010. (BibTeX)

General texts or surveys

Informatique th\'eorique : complexit\'e, automates et au-del\`a. (full details)
Bournez, Olivier , Dowek, Gilles , Gilleron, R{\'e}mi , Grigorieff, Serge , Marion, Jean-Yves , Perdrix, Simon and Tison, Sophie
In {L'I.A. fronti{\`e}res et Applications}. (Marquis, Pierre and Papini, Odile and Prades, Henri, Eds.). http://www.cepadues.com/, C{\'e}padu{\`e}s Editions. 2014. (PUBLISHER URL) (BibTeX)
Informatique th\'eorique : calculabilit\'e, d\'ecidabilit\'e et logique. (full details)
Bournez, Olivier , Dowek, Gilles , Gilleron, R{\'e}mi , Grigorieff, Serge , Marion, Jean-Yves , Perdrix, Simon and Tison, Sophie
In {L'I.A. fronti{\`e}res et Applications}. (Marquis, Pierre and Papini, Odile and Prades, Henri, Eds.). http://www.cepadues.com/, C{\'e}padu{\`e}s Editions. 2014. (PUBLISHER URL) (BibTeX)
Physics and Computation Special Issue. (full details)
Bournez, Olivier and Dowek, Gilles
Natural Computing, 11(1):1. 2012. (BibTeX)
Reachability Problems (RP 2009) Special Issue. (full details)
Bournez, Olivier and Potapov, Igor
volume 22 of International Journal of Foundations of Computer Science. 2011. (BibTeX)
Th\`ese de Church. Autres Mod\`eles de Calculs. (full details)
Bournez, Olivier
Technical report. 2009. (PDF) (BibTeX)
Reachability Problems, 3rd International Workshop, RP 2009, Palaiseau, France, September 23-25, 2009. Proceedings. (full details)
Bournez, Olivier and Potapov, Igor
(Bournez, Olivier and Potapov, Igor, Eds.)volume 5797 of Lecture Notes in Computer Science, Springer. 2009. (BibTeX)

Habilitation or PhD Documents

Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 2. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 3. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Annexe {A}. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 1. {H}abilitation {\`a} Diriger les Recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 4. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Chapitre 5. {H}abilitation {\`a} diriger des recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. (BibTeX)
Mod\`eles Continus. Calculs. Algorithmique Distribu\'ee. (full details)
Bournez, Olivier
Habilitation à Diriger les Recherches, Institut National Polytechnique de Lorraine. 7 D{\'e}cembre. 2006. R{\'e}sum{\'e} et T{\'e}l{\'e}chargement. Abstract and Download. (BibTeX)
Complexit\'e Algorithmique des Syst\`emes Dynamiques Continus et Hybrides. (full details)
Bournez, Olivier
PhD Thesis, Ecole Normale Sup{\'e}rieure de Lyon. 18 Janvier. 1999. R{\'e}sum{\'e} et T{\'e}l{\'e}chargement. Abstract and Download. (BibTeX)

Not covered by previous categories


A Universal Ordinary Differential Equation. (full details)
Bournez, Olivier and Pouly, Amaury
In International Colloquium on Automata Language Programming, ICALP'2017.. 2017. (BibTeX)
Axiomatizing Analog Algorithms. (full details)
{Bournez}, O. , {Dershowitz}, N. and {N{\'e}ron}, P.
Technical report. 2016. (BibTeX)
Homonym Population Protocols. (full details)
{Bournez}, O. , {Cohen}, J. and {Rabie}, M.
Technical report. 2016. (BibTeX)
On the Functions Generated by the General Purpose Analog Computer. (full details)
{Bournez}, O. , {Gra{\c c}a}, D. and {Pouly}, A.
Technical report. 2016. (BibTeX)
Page last modified on June 10, 2017, at 10:41 AM