Skip to main content
SpringerLink
Log in

A graphical representation of interval logic

  • Invited Papers
  • Conference paper
  • First Online:
CONCURRENCY 88 (CONCURRENCY 1988)

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

Included in the following conference series:

Abstract

Temporal Logic has the potential to improve current methods for specifying and reasoning about asynchronous systems. However, standard temporal logics have been difficult to use, because they are rather low level for the design of realistic systems and are based on modal logics that are not intuitive to users. To be more appropriate for describing complex systems, Interval Logic has been designed as a higher-level temporal logic with a graphical representation. A not quite trivial proof is presented to demonstrate the ability to represent proofs graphically.

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. Barringer, H., Kuiper, R., and Pnueli, A., “Now You May Compose Temporal Logic Specifications,” Proceedings of the Sixteenth ACM Symposium on the Theory of Computing, pp. 51–63, April 1984.

    Google Scholar 

  2. Clarke, E. M., and Emerson, E. A., “Synthesis of Synchronization Skeletons for Branching Time Temporal Logic,” Proceedings of the Workshop on Logic of Programs, Lecture Notes in Computer Science, 131, pp. 51–71, 1981.

    Google Scholar 

  3. Emerson, E. A., “Alternative Semantics for Temporal logics,” Theoretical Computer Science, 26, pp. 120–130, 1983.

    Google Scholar 

  4. “ESTELLE — A Formal Description Technique Based on an Extended State Transition Model,” ISO/TC 97/SC 21 N 422, June 1985.

    Google Scholar 

  5. Hailpern, B., “Verifying Concurrent Processes Using Temporal Logic,” Technical Report 195, Computer Systems Laboratory, Stanford University, August 1980.

    Google Scholar 

  6. Halpern, J. Y., and Shoham, Y., “A Propositional Modal Logic of Time Intervals,” Proceedings of the First Annual IEEE Symposium on Logic in Computer Science, pp. 279–292, June 1986.

    Google Scholar 

  7. Hughes, G. E., and Creswell, M. J., An Introduction to Modal Logic, Methuen and Co. Ltd., 1968.

    Google Scholar 

  8. Lamport. L., “Specification Simplified,” Technical Report, Systems Research Center, Digital Equipment Corporation, 1986.

    Google Scholar 

  9. “LOTOS — A Formal Description Technique based on Temporal Ordering of Observational Behavior,” ISO/TC 97/DP8807, March 1985.

    Google Scholar 

  10. Lynch, N. A., and Merritt, M., “Introduction to the Theory of Nested Transactions,” Technical Report, MIT, April 1987.

    Google Scholar 

  11. Melliar-Smith, P. M., “Extending Interval Logic to Real Time Systems,” Workshop on Temporal Logic, University of Manchester, April 1987.

    Google Scholar 

  12. Melliar-Smith, P. M., “Research into Distributed Systems,” Technical Report, SRI International, June 1987.

    Google Scholar 

  13. Moszkowski, B., “A Temporal Logic for Multi-Level Reasoning about Hardware,” Technical Report STAN-CS-82-952, Department of Computer Science, Stanford University, December 1982.

    Google Scholar 

  14. Pnueli, A., “The Temporal Logic of Programs,” Proceedings of the Eighteenth Symposium on the Foundations of Computer Science, pp. 46–57, November 1977.

    Google Scholar 

  15. Schwartz, R., and Melliar-Smith, P. M., “From State Machines to Temporal Logic: Specification Methods for Protocol Standards,” IEEE Transactions on Communications, C30, 12, pp. 2486–2496, December 1982.

    Google Scholar 

  16. Schwartz, R. L., Melliar-Smith, P. M., and Vogt, F., “An Interval Based Temporal Logic,” ACM Workshop on the Logics of Programming, Lecture Notes in Computer Science, 164, pp. 443–457, 1983.

    Google Scholar 

  17. Schwartz, R. L., Melliar-Smith, P. M., and Vogt, F., “An Interval Logic for Higher-Level Temporal Reasoning,” ACM Symposium on Principles of Distributed Computing, pp. 173–186, 1983.

    Google Scholar 

  18. Schwartz, R. L., Melliar-Smith, P. M., and Vogt, F., “Interval Logic: A Higher-Level Temporal Logic for Protocol Specification,” Proceedings of the IFIP WG6.1 Third International Workshop on Protocol Specification, Testing and Verification, pp. 3–18, 1983.

    Google Scholar 

  19. Wolper, P., “Synthesis of Communicating Processes from Temporal Logic Specifications,” Report No. STAN-CS-82-925, Department of Computer Science, Stanford University, August 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of California, 93106, Santa Barbara, CA

    P. M. Melliar-Smith

Authors
  1. P. M. Melliar-Smith
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frederich H. Vogt

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Melliar-Smith, P.M. (1988). A graphical representation of interval logic. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_36

Download citation

  • DOI: https://doi.org/10.1007/3-540-50403-6_36

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50403-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation