Skip to main content

A Statistical Approach for Computing Reachability of Non-linear and Stochastic Dynamical Systems

  • Conference paper
Book cover Quantitative Evaluation of Systems (QEST 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8657))

Included in the following conference series:

Abstract

We present a novel approach to compute reachable sets of dynamical systems with uncertain initial conditions or parameters, leveraging state-of-the-art statistical techniques. From a small set of samples of the true reachable function of the system, expressed as a function of initial conditions or parameters, we emulate such function using a Bayesian method based on Gaussian Processes. Uncertainty in the reconstruction is reflected in confidence bounds which, when combined with template polyhedra ad optimised, allow us to bound the reachable set with a given statistical confidence. We show how this method works straightforwardly also to do reachability computations for uncertain stochastic models.

G.S. acknowledges support from the ERC under grant MLCS 306999. L.B. acknowledges partial support from EU-FET project QUANTICOL (nr. 600708) and by FRA-UniTS.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersson, H., Britton, T.: Stochastic Epidemic Models and Their Statistical Analysis. Springer (2000)

    Google Scholar 

  2. Bartocci, E., Bortolussi, L., Nenzi, L., Sanguinetti, G.: On the robustness of temporal properties for stochastic models. In: Proc. of HSB. EPTCS, vol. 125, pp. 3–19 (2013)

    Google Scholar 

  3. Becker, W., Worden, K., Rowson, J.: Bayesian sensitivity analysis of bifurcating nonlinear models. Mechanical Systems and Signal Processing 34(1-2), 57–75 (2013)

    Article  Google Scholar 

  4. Belta, C., Habets, L.C.: Controlling a class of nonlinear systems on rectangles. IEEE Trans. on Automatic Control 51(11), 1749–1759 (2006)

    Article  MathSciNet  Google Scholar 

  5. Bhatia, A., Frazzoli, E.: Incremental search methods for reachability analysis of continuous and hybrid systems. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 142–156. Springer, Heidelberg (2004)

    Google Scholar 

  6. Bishop, C.M.: Pattern recognition and machine learning. Springer, NY (2009)

    Google Scholar 

  7. Bortolussi, L., Hillston, J., Latella, D., Massink, M.: Continuous approximation of collective systems behaviour: a tutorial. Performance Evaluation (2013)

    Google Scholar 

  8. Bortolussi, L., Sanguinetti, G.: Learning and designing stochastic processes from logical constraints. In: Joshi, K., Siegle, M., Stoelinga, M., D’Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 89–105. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  9. Bortolussi, L., Sanguinetti, G.: Smoothed model checking for uncertain Continuous Time Markov Chains. arXiv preprint arXiv:1402.1450 (2014)

    Google Scholar 

  10. Bujorianu, L.M.: A statistical inference method for the stochastic reachability analysis. In: Proceedings of IEEE CDC 2005 (2005)

    Google Scholar 

  11. Burden, R.L., Faires, J.D.: Numerical analysis. Brooks/Cole, Cengage Learning, Boston (2011)

    Google Scholar 

  12. Chutinan, A., Krogh, B.H.: Computing polyhedral approximations to flow pipes for dynamic systems. In: Proc. of IEEE CDC, vol. 2 (1998)

    Google Scholar 

  13. Dang, T., Dreossi, T.: Falsifying oscillation properties of parametric biological models. In: Proc. of HSB. EPTCS, vol. 125 (2013)

    Google Scholar 

  14. Dang, T., Gawlitza, T.M.: Template-based unbounded time verification of affine hybrid automata. In: Yang, H. (ed.) APLAS 2011. LNCS, vol. 7078, pp. 34–49. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  15. Dang, T., Le Guernic, C., Maler, O.: Computing reachable states for nonlinear biological models. Theor. Comput. Sci. 412(21) (2011)

    Google Scholar 

  16. Dang, T., Nahhal, T.: Coverage-guided test generation for continuous and hybrid systems. Formal Methods in System Design 34(2) (2009)

    Google Scholar 

  17. De Schutter, B., Heemels, W.P., Lunze, J., Prieur, C.: Survey of modeling, analysis, and control of hybrid systems. In: Handbook of Hybrid Systems Control–Theory, Tools, Applications, pp. 31–55 (2009)

    Google Scholar 

  18. Donzé, A., Maler, O.: Systematic simulation using sensitivity analysis. In: Bemporad, A., Bicchi, A., Buttazzo, G. (eds.) HSCC 2007. LNCS, vol. 4416, pp. 174–189. Springer, Heidelberg (2007)

    Google Scholar 

  19. Duggirala, P.S., Mitra, S., Viswanathan, M.: Verification of annotated models from executions. In: Proc. of ACM EMSOFT 2013 (2013)

    Google Scholar 

  20. Frehse, G., et al.: SpaceEx: Scalable verification of hybrid systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 379–395. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  21. Gardiner, C.W.: Stochastic methods. Springer (2009)

    Google Scholar 

  22. Girard, A., Le Guernic, C., Maler, O.: Efficient computation of reachable sets of linear time-invariant systems with inputs. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 257–271. Springer, Heidelberg (2006)

    Google Scholar 

  23. Girard, A., Pappas, G.J.: Verification using simulation. In: Hespanha, J.P., Tiwari, A. (eds.) HSCC 2006. LNCS, vol. 3927, pp. 272–286. Springer, Heidelberg (2006)

    Google Scholar 

  24. Kurzhanski, A.B., Varaiya, P.: On ellipsoidal techniques for reachability analysis. Optimization Methods and Software 17(2) (2002)

    Google Scholar 

  25. Lawrence, N.D., Sanguinetti, G., Rattray, M.: Modelling transcriptional regulation using gaussian processes. In: NIPS, pp. 785–792. MIT Press (2006)

    Google Scholar 

  26. Maler, O.: Computing reachable sets: an introduction. Technical report (2008), http://www-verimag.imag.fr/maler/Papers/reach-intro.pdf

  27. Oakley, J.E., O’Hagan, A.: Probabilistic sensitivity analysis of complex models: a bayesian approach. J. of the Royal Statistical Society B 66(3), 751–769 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  28. Rasmussen, C.E., Williams, C.K.I.: Gaussian processes for machine learning. MIT Press, Cambridge (2006)

    MATH  Google Scholar 

  29. Ben Sassi, M.A., Testylier, R., Dang, T., Girard, A.: Reachability analysis of polynomial systems using linear programming relaxations. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, vol. 7561, pp. 137–151. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  30. Srinivas, N., Krause, A., Kakade, S., Seeger, M.: Information-theoretic regret bounds for Gaussian process optimisation in the bandit setting. IEEE Trans. Inf. Th. 58(5), 3250–3265 (2012)

    Article  MathSciNet  Google Scholar 

  31. Tang, B.: Orthogonal array-based latin hypercubes. Journal of the American Statistical Association 88(424), 1392–1397 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bortolussi, L., Sanguinetti, G. (2014). A Statistical Approach for Computing Reachability of Non-linear and Stochastic Dynamical Systems. In: Norman, G., Sanders, W. (eds) Quantitative Evaluation of Systems. QEST 2014. Lecture Notes in Computer Science, vol 8657. Springer, Cham. https://doi.org/10.1007/978-3-319-10696-0_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10696-0_5

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10695-3

  • Online ISBN: 978-3-319-10696-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics