Skip to main content
SpringerLink
Log in
Book cover

Temporal Logic in Specification pp 295–303Cite as

Enforcing nondeterminism via linear time temporal logic specifications using hiding

  • Collected Papers
  • Conference paper
  • First Online:

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

Abstract

It is shown how some amount of nondeterminism can be enforced when using linear time temporal logic. This is achieved through extending the notion of satisfaction rather than changing the logic, i.e., no recourse is taken to branching time. The treatment is compared, both in intent and with respect to realisation, to a similar approach using predicate transformers.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barringer, H., Kuiper, R., Towards the Hierarchical, Temporal Logic, Specification of Concurrent Systems, LNCS 207.

    Google Scholar 

  2. Barringer, H., Kuiper, R., Pnueli, A., Now You May Compose Temporal Logic Specifications, ACM-STOC 1984.

    Google Scholar 

  3. Boom, H.J.: A weaker precondition for loops, Math. Centrum Report, Amsterdam, 1978.

    Google Scholar 

  4. Emerson, E.A., Chin-Laung Lei, Modalities for Model Checking: Branching Time Logic Strikes Back, POPL 1985.

    Google Scholar 

  5. Emerson, E.A., Halpern, Y.N., "Sometimes" and "Not Never" Revisited: On Branching versus Linear Time Temporal Logic, JACM, Vol. 33, No. 1, 1986.

    Google Scholar 

  6. Francez, N., A Case for a Forward Predicate Transformer, Inf. Proc. Letters IEEE 6:6, 1977.

    Google Scholar 

  7. Graf, S., Sifakis, J., A Logic for the Description of Non-deterministic Programs and their Properties, Inf. and Control, Vol. 68, Nos. 1–3, pp. 254–270 (1986).

    Google Scholar 

  8. Gough, G.D., M.Sc. Thesis, Decision Procedures for Temporal Logic, Univ. of Manchester, 1983.

    Google Scholar 

  9. Kuiper, R., Enforcing Nondeterminism via Linear Time Temporal Logic Specifications, Proc. of the SION Conference on Computing Science in the Netherlands, 1987.

    Google Scholar 

  10. Pnueli, A., Linear and Branching Structures in the Semantics and Logics of Reactive Systems, LNCS 194.

    Google Scholar 

  11. Pratt, V., Modelling Concurrency with Partial Orders, International Journal of Parallel Programming 15, 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Ruurd Kuiper

Authors
  1. Ruurd Kuiper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

B. Banieqbal H. Barringer A. Pnueli

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuiper, R. (1989). Enforcing nondeterminism via linear time temporal logic specifications using hiding. In: Banieqbal, B., Barringer, H., Pnueli, A. (eds) Temporal Logic in Specification. Lecture Notes in Computer Science, vol 398. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51803-7_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-51803-7_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-46811-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation