Abstract
Many complex continuous systems are modeled as non-linear autonomous systems, i.e., by a set of differential equations with one independent variable. Exact reachability, i.e., whether a given configuration can be reached by starting from an initial configuration of the system, is undecidable in general, as one needs to know the solution of the system of equations under consideration.
In this paper we address the reachability problem of planar autonomous systems approximatively.We use an approximation technique which “hybridizes” the state space in the following way: the original system is partitioned into a finite set of polygonal regions where the dynamics on each region is approximated by constant differential inclusions. Besides proving soundness, completeness, and termination of our algorithm, we present an implementation, and its application into (classical) examples taken from the literature.
Keywords
- Hybrid System
- Autonomous System
- Lipschitz Constant
- Hybrid Automaton
- Reachability Analysis
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
The Scipy library, http://www.scipy.org
Asarin, E., Dang, T., Girard, A.: Reachability Analysis of Nonlinear Systems Using Conservative Approximation. In: Maler, O., Pnueli, A. (eds.) HSCC 2003. LNCS, vol. 2623, pp. 20–35. Springer, Heidelberg (2003)
Asarin, E., Bournez, O., Dang, T., Maler, O.: Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems. In: Lynch, N.A., Krogh, B.H. (eds.) HSCC 2000. LNCS, vol. 1790, pp. 20–31. Springer, Heidelberg (2000)
Asarin, E., Schneider, G., Yovine, S.: Algorithmic analysis of polygonal hybrid systems, part I: Reachability. TCS 379(1-2), 231–265 (2007)
Boyce, W., DiPrima, R.: Elementary differential equations and boundary value problems, 8th edn. Wiley, New York (2004)
Van der Pol, B., Van der Mark, J.: Frequency Demultiplication. Nature 120 (1927)
Dora, J.D., Maignan, A., Mirica-Ruse, M., Yovine, S.: Hybrid computation. In: ISSAC, pp. 101–108 (2001)
Doyen, L., Henzinger, T.A., Raskin, J.-F.: Automatic Rectangular Refinement of Affine Hybrid Systems. In: Pettersson, P., Yi, W. (eds.) FORMATS 2005. LNCS, vol. 3829, pp. 144–161. Springer, Heidelberg (2005)
Frehse, G.: PHAVer: Algorithmic verification of hybrid systems past hyTech. In: Morari, M., Thiele, L. (eds.) HSCC 2005. LNCS, vol. 3414, pp. 258–273. Springer, Heidelberg (2005)
Hansen, H.A.: GSPeeDI, http://heim.ifi.uio.no/hallstah/gspeedi/
Hansen, H.A., Schneider, G.: GSPeeDI – A Verification Tool for Generalized Polygonal Hybrid Systems. In: Leucker, M., Morgan, C. (eds.) ICTAC 2009. LNCS, vol. 5684, pp. 343–348. Springer, Heidelberg (2009)
Henzinger, T.A., Ho, P.-H., Wong-toi, H.: Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer 1(1) (1997)
Henzinger, T.A.: The theory of hybrid automata. In: LICS 1996, pp. 278–292. IEEE Computer Society (1996)
Henzinger, T.A., Ho, P.-H.: Algorithmic Analysis of Nonlinear Hybrid Systems. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 225–238. Springer, Heidelberg (1995)
Henzinger, T.A., Wong-Toi, H.: Linear phase-portrait approximations for nonlinear hybrid systems. In: Proceedings of the DIMACS/SYCON Workshop on Hybrid systems III: Verification and Control, pp. 377–388. Springer-Verlag New York, Inc., Secaucus (1996)
Ho, P.-H.: Automatic analysis of hybrid systems. PhD thesis, Ithaca, NY, USA (1995)
Ho, P.-H., Wong-toi, H.: Automated Analysis of an Audio Control Protocol. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 381–394. Springer, Heidelberg (1995)
Pace, G., Schneider, G.: A Compositional Algorithm for Parallel Model Checking of Polygonal Hybrid Systems. In: Barkaoui, K., Cavalcanti, A., Cerone, A. (eds.) ICTAC 2006. LNCS, vol. 4281, pp. 168–182. Springer, Heidelberg (2006)
Pace, G.J., Schneider, G.: Relaxing Goodness is Still Good. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 274–289. Springer, Heidelberg (2008)
Ratschan, S.: Efficient solving of quantified inequality constraints over the real numbers. ACM Transactions on Computational Logic 7(4), 723–748 (2006)
Ratschan, S., She, Z.: Safety Verification of Hybrid Systems by Constraint Propagation Based Abstraction Refinement. ACM Transactions in Embedded Computing Systems 6(1), 573–589 (2007)
Stursberg, O., Kowalewski, S.: Approximating switched continuous systems by rectangular automata. In: European Control Conference (1999)
Weise, T.: Global Optimization Algorithms Theory and Application. E-book, 2nd edn (2009), http://www.it-weise.de/
Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 78: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization. ACM Trans. Math. Softw. 23(4), 550–560 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hansen, H.A., Schneider, G., Steffen, M. (2012). Reachability Analysis of Non-linear Planar Autonomous Systems. In: Arbab, F., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2011. Lecture Notes in Computer Science, vol 7141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29320-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-29320-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-29319-1
Online ISBN: 978-3-642-29320-7
eBook Packages: Computer ScienceComputer Science (R0)
