Skip to main content
SpringerLink
Log in

A temporal analysis of some concurrent systems

  • 4. Solutions
  • Conference paper
  • First Online:
The Analysis of Concurrent Systems

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

  • 122 Accesses

Abstract

In previous work, we presented interval temporal logic (ITL), a formal logic for reasoning about time. It was shown that ITL provides a way to view programming constructs for assignment, repetition and parallelism as logical operators. This paper demonstrates the applicability of ITL to some problems given in the STL concurrency workshop. These include a bidirectional channel, a railway and a message-routing network.

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. J. Halpern, Z. Manna and B. Moszkowski. A hardware semantics based on temporal intervals. Proceedings of the 10-th International Colloquium on Automata, Languages and Programming, Barcelona, Spain, July, 1983.

    Google Scholar 

  2. Z. Manna and A. Pnueli. Verification of concurrent programs: The temporal framework. In R. S. Boyer and J. S. Moore, editors, The Correctness Problem in Computer Science, pages 215–273, Academic Press, New York, 1981.

    Google Scholar 

  3. B. Moszkowski. Reasoning about Digital Circuits. PhD Thesis, Department of Computer Science, Stanford University, 1983.

    Google Scholar 

  4. B. Moszkowski and Z. Manna. Reasoning in interval temporal logic. Dept. of Computer Science, Stanford University, Technical Report STAN-CS-83-969.

    Google Scholar 

  5. B. Moszkowski and Z. Manna. Temporal logic as a programming language. To appear in the proceedings of Parallel Computing 83, West Berlin, Sept., 1983

    Google Scholar 

  6. N. Rescher and A. Urquart. Temporal Logic. Springer-Verlag, New York, 1971.

    Google Scholar 

  7. Problem set for the concurrency workshop. In these proceedings.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Laboratory, University of Cambridge, Corn Exchange Street, CB2 3QG, Cambridge, England

    Ben Moszkowski

Authors
  1. Ben Moszkowski
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. T. Denvir W. T. Harwood M. I. Jackson M. J. Wray

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Moszkowski, B. (1985). A temporal analysis of some concurrent systems. In: Denvir, B.T., Harwood, W.T., Jackson, M.I., Wray, M.J. (eds) The Analysis of Concurrent Systems. Lecture Notes in Computer Science, vol 207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16047-7_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-16047-7_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation