Skip to main content
SpringerLink
Log in
Book cover

International Andrei Ershov Memorial Conference on Perspectives of System Informatics

PSI 2009: Perspectives of Systems Informatics pp 230–241Cite as

Σ K –constraints for Hybrid Systems

  • Conference paper

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

Abstract

In this paper we introduce and study computational aspects of \(\it \Sigma_K\)-constraints which are powerful enough to represent computable continuous data, but also simple enough to be an approach to approximate constraint solving for a large class of quantified continuous constraints. We illustrate how \(\it \Sigma_K\)-constraints can be used for reasoning about hybrid systems.

This research was partially supported by EPSRC grant EP/E050441/1, DFG-RFBR (grant No 436 RUS 113/1002/01, grant No 09-01-91334).

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Anai, H., Weispfenning, V.: Reach set computation using real quantifier elimination. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A.L. (eds.) HSCC 2001. LNCS, vol. 2034, p. 63. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  2. Brattka, V., Weihrauch, K.: Computability on subsets of euclidean space I: Closed and compact sets. TCS 219, 65–93 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Barwise, J.: Admissible sets and Structures. Springer, Berlin (1975)

    MATH  Google Scholar 

  4. Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  5. Benhamou, F., Goualard, F., Languénou, E., Christie, M.: Interval constraint solving for camera control and motion planning. ACM Trans. Comput. Log. 5(4), 732–767 (2004)

    Article  MathSciNet  Google Scholar 

  6. Caviness, B.F., Johnson, J.R. (eds.): Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer, Wien (1998)

    MATH  Google Scholar 

  7. Collins, G.E.: Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)

    Google Scholar 

  8. Ershov, Y.L.: Definability and computability. Plenum, New York (1996)

    Google Scholar 

  9. Henzinger, T.A., Rusu, V.: Reachability Verification for Hybrid Automata. In: Henzinger, T.A., Sastry, S.S. (eds.) HSCC 1998. LNCS, vol. 1386, pp. 190–205. Springer, Heidelberg (1998)

    Google Scholar 

  10. Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  11. Blass, A., Gurevich, Y.: Background, reserve and Gandy machines. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol. 1862, pp. 1–17. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  12. Korovina, M.V., Kudinov, O.V.: Towards Computability over Effectively Enumerable Topological Spaces. Electr. Notes Theor. Comput. Sci. 202, 305–313 (2008)

    Article  Google Scholar 

  13. Korovina, M.V., Kudinov, O.V.: Towards computability of higher type continuous data. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 235–241. Springer, Heidelberg (2005)

    Google Scholar 

  14. Korovina, M.V.: Computational aspects of Σ-definability over the real numbers without the equality test. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 330–344. Springer, Heidelberg (2003)

    Google Scholar 

  15. Korovina, M.V.: Gandy’s theorem for abstract structures without the equality test. In: Vardi, M.Y., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 290–301. Springer, Heidelberg (2003)

    Google Scholar 

  16. Korovina, M.V., Kudinov, O.V.: Semantic characterisations of second-order computability over the real numbers. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 160–172. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  17. Korovina, M.V., Kudinov, O.V.: Formalisation of Computability of Operators and Real-Valued Functionals via Domain Theory. In: Blank, J., Brattka, V., Hertling, P. (eds.) CCA 2000. LNCS, vol. 2064, pp. 146–168. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Korovina, M.V., Kudinov, O.V.: Generalised Computability and Applications to Hybrid Systems. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds.) PSI 2001. LNCS, vol. 2244, pp. 494–499. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Korovina, M.V., Kudinov, O.V.: Characteristic properties of majorant-computability over the reals. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol. 1584, pp. 188–203. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  20. Dahlhaus, E., Makowsky, J.A.: Query languages for hierarchic databases. Information and Computation 101, 1–32 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  21. Nerode, A., Kohn, W.: Models for Hybrid Systems: Automata, Topologies, Controllability, Observability. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 317–357. Springer, Heidelberg (1993)

    Google Scholar 

  22. Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Heidelberg (1988)

    Google Scholar 

  23. Ratschan, S., She, Z.: Constraints for Continuous Reachability in the Verification of Hybrid Systems. In: Calmet, J., Ida, T., Wang, D. (eds.) AISC 2006. LNCS (LNAI), vol. 4120, pp. 196–210. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  24. Tarski, A.: A Decidion Method in Algebra and Geometry. University of California Press, Berkeley (1951)

    Google Scholar 

  25. Tiwari, A.: Abstractions for hybrid systems. Formal Methods in System Design 32(1), 57–83 (2008)

    Article  MATH  Google Scholar 

  26. Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Interdisciplinary Computational and Dynamical Analysis, The University of Manchester and IIS SB RAS Novosibirsk,  

    Margarita Korovina

  2. Sobolev Institute of Mathematics, Novosibirsk,  

    Oleg Kudinov

Authors
  1. Margarita Korovina
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oleg Kudinov
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. (1941-2009), The Weizmann Institute of Science, Rehovot, Israel New York University, NY, USA

    Amir Pnueli

  2. Siberian Division of the Russian Academy of Sciences, A.P. Ershov Institute of Informatics Systems, 6, Acad. Lavrentiev pr., 630090, Novosibirsk, Russia

    Irina Virbitskaite

  3. Department of Computer Science, University of Manchester, Oxford Road, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Korovina, M., Kudinov, O. (2010). Σ K –constraints for Hybrid Systems. In: Pnueli, A., Virbitskaite, I., Voronkov, A. (eds) Perspectives of Systems Informatics. PSI 2009. Lecture Notes in Computer Science, vol 5947. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11486-1_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11486-1_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11485-4

  • Online ISBN: 978-3-642-11486-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation