Skip to main content

Application of the Reachability Analysis for the Iron Homeostasis Study

  • Conference paper
  • First Online:
Hybrid Systems Biology (HSB 2016)

Part of the book series: Lecture Notes in Computer Science ((LNBI,volume 9957))

Included in the following conference series:

Abstract

Our work is motivated by a model of the mammalian cellular Iron Homeostasis, which was analysed using simulations in [9]. The result of this analysis is a characterization of the parameters space such that the model satisfies a set of constraints, proposed by biologists or coming from experimental results. We now propose an approach to hypothesis validation which can be seen as a complement to the approach based on simulation. It uses reachability analysis (that is set-based simulation) to formally validate a hypothesis. For polynomials systems, reachability analysis using the Bernstein expansion is an appropriate technique. Moreover, the Bernstein technique allows us to tackle uncertain parameters at a small cost. In this work, we extend the reachability analysis method presented in [7] to handle polynomial fractions. Furthermore, to tackle the complexity of the Iron Homeostasis model, we use a piecewise approximation of the dynamics and propose a reachability method to deal with the resulting hybrid dynamics. These approximations and adaptations allowed us to validate a hypothesis stated in [9], with an exhaustive analysis over uncertain parameters and initial conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 44.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Two sigmoids are on IRP, and one on Fe.

  2. 2.

    This situation corresponds to the phase 3 described in Sect. 4.

References

  1. Batt, G., Yordanov, B., Weiss, R., Belta, C.: Robustness analysis and tuning of synthetic gene networks. Bioinformatics 23(18), 2415–2422 (2007)

    Article  Google Scholar 

  2. Berman, S., Halász, Á., Kumar, V.: MARCO: a reachability algorithm for multi-affine systems with applications to biological systems. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 76–89. Springer, Heidelberg (2007). doi:10.1007/978-3-540-71493-4_9

    Chapter  Google Scholar 

  3. Brim, L., Fabriková, J., Drazan, S., Safranek, D.: Reachability in biochemical dynamical systems by quantitative discrete approximation (2011). arXiv preprint: arXiv:1107.5924

  4. Chen, X., Ábrahám, E., Sankaranarayanan, S.: Flow*: an analyzer for non-linear hybrid systems. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 258–263. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  5. Dang, T., Maler, O., Testylier, R.: Accurate hybridization of nonlinear systems. In: Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, pp. 11–20. ACM (2010)

    Google Scholar 

  6. Dang, T., Testylier, R.: Reachability analysis for polynomial dynamical systems using the bernstein expansion. Reliable Comput. 17(2), 128–152 (2012)

    MathSciNet  Google Scholar 

  7. Dreossi, T., Dang, T., Piazza, C.: Parallelotope bundles for polynomial reachability. In: Proceedings of the 19th International Conference on Hybrid Systems: Computation and Control, pp. 297–306. ACM (2016)

    Google Scholar 

  8. Fuchs, H., Kedem, Z.M., Naylor, B.F.: On visible surface generation by a priori tree structures. ACM Siggraph Comput. Graph. 14, 124–133 (1980). ACM

    Article  Google Scholar 

  9. Mobilia, N.: Méthodologie semi-formelle pour l’étude de systèmes biologiques: application à l’homéostasie du fer. Ph.D. thesis, Université Joseph Fourier, Grenoble (2015)

    Google Scholar 

  10. Narkawicz, A., Garloff, J., Smith, A.P., Munoz, C.A.: Bounding the range of a rational functiom over a box. Reliable Comput. 17, 34–39 (2012)

    MathSciNet  Google Scholar 

  11. Platzer, A., Quesel, J.-D.: KeYmaera: a hybrid theorem prover for hybrid systems (system description). In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 171–178. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Sassi, M.A.B.: Analyse et contrôle des systèmes dynamiques polynomiaux. Ph.D. thesis, Université de Grenoble (2013)

    Google Scholar 

  13. Smith, A.P.: Fast construction of constant bound functions for sparse polynomials. J. Glob. Optim. 43(2–3), 445–458 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgement

This work is partially supported by the ANR CADMIDIA project (ANR-13-CESA-0008-03) and the ANR MALTHY project (ANR-12-INSE-003).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Alexandre Rocca .

Editor information

Editors and Affiliations

Appendix

Appendix

Table 1. Initial Set after Stabilization on the left and parameter Space on the right.

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this paper

Cite this paper

Rocca, A., Dang, T., Fanchon, E., Moulis, JM. (2016). Application of the Reachability Analysis for the Iron Homeostasis Study. In: Cinquemani, E., Donzé, A. (eds) Hybrid Systems Biology. HSB 2016. Lecture Notes in Computer Science(), vol 9957. Springer, Cham. https://doi.org/10.1007/978-3-319-47151-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-47151-8_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-47150-1

  • Online ISBN: 978-3-319-47151-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics