Skip to main content
SpringerLink
Log in

Specification and verification of constraint-based dynamic systems

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming (PPCP 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 874))

Abstract

Constraint satisfaction can be seen as a dynamic process that approaches the solution set of the given constraints asymptotically

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors. Hybrid Systems. Number 736 in Lecture Notes on Computer Science, Springer-Verlag, 1993.

    Google Scholar 

  2. G. F. Khilmi. Qualitative Methods in the Many Body Problem. Science Publishers Inc. New York, 1961.

    Google Scholar 

  3. Z. Manna and A. Pnueli. Specification and verification of concurrent programs by ∀-automata. In Proc. 14th Ann. ACM Symp. on Principles of Programming Languages, pages 1–12, 1987.

    Google Scholar 

  4. A. Nerode and W. Kohn. Models for hybrid systems: Automata, topologies, controllability, observability. In R. L. Grossman, A. Nerode, A. P. Ravn, and H. Rischel, editors, Hybrid Systems, number 736 in Lecture Notes on Computer Science. Springer-Verlag, 1993.

    Google Scholar 

  5. V. Saraswat, R. Jagadeesan, and V. Gupta. Programming in timed concurrent constraint languages. In B. Mayoh, E. Tyugu, and J. Penjam, editors, Constraint Programming, NATO Advanced Science Institute Series, Series F: Computer And System Sciences. 1994.

    Google Scholar 

  6. Y. Zhang and A. K. Mackworth. Constraint programming in constraint nets. In First Workshop on Principles and Practice of Constraint Programming, pages 303–312, 1993. A revised version will appear in a book with the same title in MIT Press, 1995.

    Google Scholar 

  7. Y. Zhang and A. K. Mackworth. Design and analysis of embedded real-time systems: An elevator case study. Technical Report 93-4, Department of Computer Science, University of British Columbia, February 1993.

    Google Scholar 

  8. Y. Zhang and A. K. Mackworth. Constraint Nets: A semantic model for hybrid dynamic systems, 1994. Accepted for TCS Special Issue on Hybrid Systems.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of British Columbia, V6T 1Z4, Vancouver B.C., Canada

    Ying Zhang & Alan K. Mackworth (Shell Canada Fellow)

  2. Canadian Institute for Advanced Research, Canada

    Alan K. Mackworth (Shell Canada Fellow)

Authors
  1. Ying Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alan K. Mackworth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alan Borning

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhang, Y., Mackworth, A.K. (1994). Specification and verification of constraint-based dynamic systems. In: Borning, A. (eds) Principles and Practice of Constraint Programming. PPCP 1994. Lecture Notes in Computer Science, vol 874. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58601-6_104

Download citation

  • DOI: https://doi.org/10.1007/3-540-58601-6_104

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58601-2

  • Online ISBN: 978-3-540-49032-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation