1. E. Asarin, T. Dang & A. Girard (2007): Hybridization methods for the analysis of nonlinear systems. Acta Informatica. 43(7), pp. 451–476, doi:10.1007/s00236-006-0035-7.
  2. G. Batt, H. de Jong, J. Geiselmann, M. Page, D. Ropers & D. Schneider (2005): Qualitative analysis and verification of hybrid models of genetic regulatory networks : Nutritional stress response in Escherichia coli. In: M. Morari & L. Thiele: Hybrid Systems: Computation and Control, LNCS 3414. Springer-Verlag, pp. 134–150, doi:10.1007/978-3-540-31954-2_9.
  3. Grégory Batt, Boyan Yordanov, Ron Weiss, Calin Belta & Calin Belta (2007): Robustness analysis and tuning of synthetic gene networks., pp. 2415–2422, doi:10.1093/bioinformatics/btm362.
  4. Calin Belta & Luc C. G. J. M. Habets (2006): Controlling a Class of Nonlinear Systems on Rectangles. IEEE Transactions on Automatic Control 51, pp. 1749–1759, doi:10.1109/TAC.2006.884957.
  5. Spring Berman, Ádám M. Halász, Vijay Kumar & Vijay Kumar (2007): MARCO: A Reachability Algorithm for Multi-affine Systems with Applications to Biological Systems.. In: HSCC, pp. 76–89, doi:10.1007/978-3-540-71493-4_9.
  6. N.F. Britton, N. R. Franks, S. C. Pratt & T. D. Seeley (2002): Deciding on a new home: how do honeybees agree?. In: Proceedings of the Royal Society of London Series B - Biological Sciences, 269(1498), pp. 1383–1388, doi:10.1098/rspb.2002.2001.
  7. Liqian Chen, Antoine Miné, Ji Wang & Patrick Cousot (2009): Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships. In: SAS, Lecture Notes in Computer Science 5673. Springer, pp. 309–325, doi:10.1007/978-3-642-03237-0_21.
  8. F. Clauss & I.Yu. Chupaeva (2004): Application of symbolic approach to the bernstein expansion for program analysis and optimization. Program. Comput. Softw. 30(3), pp. 164–172.
  9. Thao Dang, Colas Le Guernic & Oded Maler (2011): Computing reachable states for nonlinear biological models. Theoretical Computer Science, doi:10.1016/j.tcs.2011.01.014.
  10. Thao Dang & David Salinas (2009): Image computation for polynomial dynamical systems using the Bernstein expansion. In: Ahmed Bouajjani & Oded Maler: Computer Aided Verification, CAV 2009, Lecture Notes in Computer Science 5643. Springer, pp. 219–232, doi:10.1007/978-3-642-02658-4_19.
  11. Thao Dang & Romain Testylier (2011): Hybridization Domain Construction using Curvature Estimation. In: Proceedings HSCC 2011. ACM, doi:10.1145/1967701.1967721.
  12. S. Drulhe, G. Ferrari-Trecate & H. de Jong (2008): The switching threshold reconstruction problem for piecewise affine models of genetic regulatory networks. IEEE Transactions on Automatic Control and IEEE Transactions on Circuits and Systems 53(1), pp. 153–165, doi:10.1109/TAC.2007.911326.
  13. I.A. Fotiou, P. Rostalski, P.A. Parrilo & M. Morari (2006): Parametric Optimization and Optimal Control using Algebraic Geometriy Methods. International Journal of Control 79(11), pp. 1340–1358, doi:10.1080/00207170600726592.
  14. J. Garloff & A.P. Smith (2008): Rigorous Affine Lower Bound Functions for Multivariate Polynomials and their Use in Global Optimisation. In: Proceedings of the 1st International Conference on Applied Operational Research, Tadbir Institute for Operational Research, Systems Design and Financial Services, Lecture Notes in Management Science 1, pp. 199–211.
  15. Radu Grosu, Grégory Batt, Flavio H. Fenton, James Glimm, Colas Le Guernic, Scott A. Smolka & Ezio Bartocci (2011): From Cardiac Cells to Genetic Regulatory Networks. In: CAV, Lecture Notes in Computer Science 6806. Springer, pp. 396–411, doi:10.1007/978-3-642-22110-1_31.
  16. H. Prautzsch and W. Boehm (2002): Box splines. In: G. Farin, J. Hoschek, M.S. Kim: Handbook of Computer Aided Geometric Design. Elsevier Science Publishers B.V., North-Holland, Amsterdam, pp. 255–282, doi:10.1016/B978-044451104-1/50011-3.
  17. T. A. Henzinger (1996): The theory of hybrid automata. In: LICS '96: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, pp. 278, doi:10.1109/LICS.1996.561342.
  18. I. Tchoupaeva (2004): A symbolic approach to bernstein expansion for program analysis and optimization. In: 13th International Conference on Compiler Construction, CC 2004. Springer, pp. 120–133, doi:10.1007/978-3-540-24723-4_9.
  19. J. Garloff (2004): Application of Bernstein Expansion to the Solution of Control Problems. In: J. Vehi and M. A. Sainz: Workshop on Applications of Interval Analysis to Systems and Control, pp. 421–430.
  20. J. Garloff and A.P. Smith (2005): A comparison of methods for the computation of affine lower bound functions for polynomials. In: C. Jermann, A. Neumaier & D. Sam: Global Optimization and Constraint Satisfaction, LNCS. Springer, pp. 71–85, doi:10.1007/11425076_6.
  21. Stephen Prajna & Ali Jadbabaie (2004): Safety Verification of Hybrid Systems Using Barrier Certificates.. In: Rajeev Alur & George J. Pappas: Hybrid Systems: Computation and Control, Lecture Notes in Computer Science 2993. Springer, pp. 477–492, doi:10.1007/978-3-540-24743-2_32.
  22. S. Boyd and S. Vandenberghe (2004): Convex optimization. Cambridge Uni. Press.
  23. S. Sankaranarayanan, H. Sipma & Z. Manna (2005): Scalable analysis of linear systems using mathematical programming. In: Verification, Model-Checking and Abstract-Interpretation (VMCAI 2005), LNCS 3385. Springer, doi:10.1007/978-3-540-30579-8_2.
  24. Thao Dang (2006): Approximate Reachability Computation for Polynomial Systems. In: João P. Hespanha and Ashish Tiwari: Hybrid Systems: Computation and Control HSCC, Lecture Notes in Computer Science 3927. Springer, pp. 138–152, doi:10.1007/11730637_13.

Comments and questions to:
For website issues: