skip to main content
10.1145/2728606.2728607acmconferencesArticle/Chapter ViewAbstractPublication PagescpsweekConference Proceedingsconference-collections
research-article

Efficient finite abstraction of mixed monotone systems

Published:14 April 2015Publication History

ABSTRACT

We present an efficient computational procedure for finite abstraction of discrete-time mixed monotone systems by considering a rectangular partition of the state space. Mixed monotone systems are decomposable into increasing and decreasing components, and significantly generalize the well known class of monotone systems. We tightly overapproximate the one-step reachable set from a box of initial conditions by computing a decomposition function at only two points, regardless of the dimension of the state space. We apply our results to verify the dynamical behavior of a model for insect population dynamics and to synthesize a signaling strategy for a traffic network.

References

  1. M. W. Hirsch, "Systems of differential equations that are competitive or cooperative II: Convergence almost everywhere," SIAM Journal on Mathematical Analysis, vol. 16, no. 3, pp. 423--439, 1985.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. H. L. Smith, Monotone dynamical systems: An introduction to the theory of competitive and cooperative systems. American Math. Soc., 1995.Google ScholarGoogle Scholar
  3. M. Hirsch and H. Smith, "Monotone maps: a review," Journal of Difference Equations and Applications, vol. 11, no. 4--5, pp. 379--398, 2005.Google ScholarGoogle Scholar
  4. D. Angeli and E. Sontag, "Monotone control systems," IEEE Transactions on Automatic Control, vol. 48, no. 10, pp. 1684--1698, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  5. J. Gouzé and K. Hadeler, "Monotone flows and order intervals," Nonlinear World, vol. 1, pp. 23--34, 1994.Google ScholarGoogle Scholar
  6. H. Smith, "The discrete dynamics of monotonically decomposable maps," Journal of Mathematical Biology, vol. 53, no. 4, pp. 747--758, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  7. H. Smith, "Global stability for mixed monotone systems," Journal of Difference Equations and Applications, vol. 14, no. 10--11, pp. 1159--1164, 2008.Google ScholarGoogle Scholar
  8. G. Enciso, H. Smith, and E. Sontag, "Nonmonotone systems decomposable into monotone systems with negative feedback," Journal of Differential Equations, vol. 224, no. 1, pp. 205--227, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  9. R. Alur, T. A. Henzinger, G. Lafferriere, and G. J. Pappas, "Discrete abstractions of hybrid systems," Proceedings of the IEEE, vol. 88, no. 7, pp. 971--984, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  10. A. Tiwari and G. Khanna, "Series of abstractions for hybrid automata," in Hybrid Systems: Computation and Control, pp. 465--478, Springer, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. P. Tabuada, Verification and control of hybrid systems: a symbolic approach. Springer, 2009. Google ScholarGoogle ScholarCross RefCross Ref
  12. T. Wongpiromsarn, U. Topcu, and R. Murray, "Receding horizon temporal logic planning," IEEE Transactions on Automatic Control, vol. 57, pp. 2817--2830, Nov 2012.Google ScholarGoogle ScholarCross RefCross Ref
  13. J. Liu, N. Ozay, U. Topcu, and R. Murray, "Synthesis of reactive switching protocols from temporal logic specifications," IEEE Transactions on Automatic Control, vol. 58, pp. 1771--1785, July 2013.Google ScholarGoogle ScholarCross RefCross Ref
  14. E. M. Clarke, O. Grumberg, and D. A. Peled, Model checking. MIT press, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. Baier and J. Katoen, Principals of Model Checking. MIT Press, 2008.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. T. A. Henzinger, P. W. Kopke, A. Puri, and P. Varaiya, "What's decidable about hybrid automata?," Journal of Computer and System Sciences, vol. 57, no. 1, pp. 94--124, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. P. Tabuada and G. Pappas, "Linear time logic control of discrete-time linear systems," IEEE Transactions on Automatic Control, vol. 51, no. 12, pp. 1862--1877, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  18. A. Girard and G. J. Pappas, "Approximation metrics for discrete and continuous systems," IEEE Transactions on Automatic Control, vol. 52, no. 5, pp. 782--798, 2007.Google ScholarGoogle ScholarCross RefCross Ref
  19. A. Girard, G. Pola, and P. Tabuada, "Approximately bisimilar symbolic models for incrementally stable switched systems," IEEE Transactions on Automatic Control, vol. 55, no. 1, pp. 116--126, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  20. G. Reißig, "Computing abstractions of nonlinear systems," IEEE Transactions on Automatic Control, vol. 56, no. 11, pp. 2583--2598, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  21. B. Yordanov, J. Tůmová, I. Černá, J. Barnat, and C. Belta, "Temporal logic control of discrete-time piecewise affine systems," IEEE Transactions on Automatic Control, vol. 57, no. 6, pp. 1491--1504, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  22. D. Adzkiya, B. De Schutter, and A. Abate, "Finite abstractions of max-plus-linear systems," IEEE Transactions on Automatic Control, vol. 58, pp. 3039--3053, Dec 2013.Google ScholarGoogle ScholarCross RefCross Ref
  23. T. Moor and J. Raisch, "Abstraction based supervisory controller synthesis for high order monotone continuous systems," in Modelling, Analysis, and Design of Hybrid Systems, pp. 247--265, Springer, 2002.Google ScholarGoogle Scholar
  24. D. Gromov and J. Raisch, "Detecting and enforcing monotonicity for hybrid control systems synthesis," in Proc. 2nd IFAC Conf. on Analysis and Design of Hybrid Systems, pp. 7--9, 2006.Google ScholarGoogle Scholar
  25. N. Ramdani, N. Meslem, and Y. Candau, "Computing reachable sets for uncertain nonlinear monotone systems," Nonlinear Analysis: Hybrid Systems, vol. 4, no. 2, pp. 263--278, 2010.Google ScholarGoogle ScholarCross RefCross Ref
  26. J. M. Cushing, An introduction to structured population dynamics. SIAM, 1998.Google ScholarGoogle ScholarCross RefCross Ref
  27. M. Kulenovic and O. Merino, "A global attractivity result for maps with invariant boxes," Discrete and Continuous Dynamical Systems Series B, vol. 6, no. 1, p. 97, 2006.Google ScholarGoogle ScholarCross RefCross Ref
  28. D. Peled and T. Wilke, "Stutter-invariant temporal properties are expressible without the next-time operator," Information Processing Letters, vol. 63, no. 5, pp. 243--246, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. A. Kurzhanskiy and P. Varaiya, "Computation of reach sets for dynamical systems," in The Control Systems Handbook, ch. 29, CRC Press, second ed., 2010.Google ScholarGoogle Scholar
  30. R. Costantino, J. Cushing, B. Dennis, and R. A. Desharnais, "Experimentally induced transitions in the dynamic behaviour of insect populations," Nature, vol. 375, no. 6528, pp. 227--230, 1995.Google ScholarGoogle ScholarCross RefCross Ref
  31. G. J. Holzmann, "The model checker SPIN," IEEE Transactions on Software Engineering, vol. 23, pp. 279--295, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. S. Coogan, E. A. Gol, M. Arcak, and C. Belta, "Traffic network control from temporal logic specifications," 2014. arXiv:1408.1437.Google ScholarGoogle Scholar
  33. C. F. Daganzo, "The cell transmission model, part II: Network traffic," Transportation Research Part B: Methodological, vol. 29, no. 2, pp. 79--93, 1995.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Efficient finite abstraction of mixed monotone systems

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          HSCC '15: Proceedings of the 18th International Conference on Hybrid Systems: Computation and Control
          April 2015
          321 pages
          ISBN:9781450334334
          DOI:10.1145/2728606

          Copyright © 2015 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 14 April 2015

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          Overall Acceptance Rate153of373submissions,41%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader