Skip to main content
SpringerLink
Log in

A proof rule for control loops

  • Conference paper
  • First Online:
Mathematics of Program Construction (MPC 1998)

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

Included in the following conference series:

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. C.A.R. Hoare and B. von Karger. Sequential calculus. Information Processing Letters, 53:123–130, 1995.

    Article  MathSciNet  Google Scholar 

  2. B. Dutertre. On first order interval temporal logic. Technical Report CSD-TR-94-3, Royal Holloway University of London, November 1994.

    Google Scholar 

  3. P. Jipsen and R. Maddux. Nonrepresentable sequential algebras. Logic Journal of the IGPL, 5(4): 565–574, 1997.

    Article  MathSciNet  Google Scholar 

  4. B. Moszkowski. Some very compositional temporal properties. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, volume A-56 of IFIP Transactions. North-Holland, 1994.

    Google Scholar 

  5. B. von Karger. Temporal algebra. Habilitation Thesis, available through WWW http://www.informatik.uni-kiel.de/~bvk/, 1996.

    Google Scholar 

  6. B. von Karger and R. Berghammer. A relational model for temporal logic. Logic Journal of the IGPL, 6(2): 157–173, 1998.

    Article  MathSciNet  Google Scholar 

  7. C. Zhou, C. A. R. Hoare, and A. P. Ravn. A calculus of durations. Information Processing Letters, 40:269–276, 1992.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik und Praktische Mathematik, Christian-Albrechts-Universität Kiel, Preusserstraße 1-9, D-24105, Kiel, Germany

    Burghard von Karger

Authors
  1. Burghard von Karger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Johan Jeuring

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

von Karger, B. (1998). A proof rule for control loops. In: Jeuring, J. (eds) Mathematics of Program Construction. MPC 1998. Lecture Notes in Computer Science, vol 1422. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054282

Download citation

  • DOI: https://doi.org/10.1007/BFb0054282

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64591-7

  • Online ISBN: 978-3-540-69345-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation