Enforcing nondeterminism via linear time temporal logic specifications using hiding

  • Ruurd Kuiper
Collected Papers Specification
Part of the Lecture Notes in Computer Science book series (LNCS, volume 398)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BK83]
    Barringer, H., Kuiper, R., Towards the Hierarchical, Temporal Logic, Specification of Concurrent Systems, LNCS 207.Google Scholar
  2. [BKP84]
    Barringer, H., Kuiper, R., Pnueli, A., Now You May Compose Temporal Logic Specifications, ACM-STOC 1984.Google Scholar
  3. [Bo78]
    Boom, H.J.: A weaker precondition for loops, Math. Centrum Report, Amsterdam, 1978.Google Scholar
  4. [EL85]
    Emerson, E.A., Chin-Laung Lei, Modalities for Model Checking: Branching Time Logic Strikes Back, POPL 1985.Google Scholar
  5. [EH86]
    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. [Fr77]
    Francez, N., A Case for a Forward Predicate Transformer, Inf. Proc. Letters IEEE 6:6, 1977.Google Scholar
  7. [GS86]
    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. [Go83]
    Gough, G.D., M.Sc. Thesis, Decision Procedures for Temporal Logic, Univ. of Manchester, 1983.Google Scholar
  9. [Ku87]
    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. [Pn85]
    Pnueli, A., Linear and Branching Structures in the Semantics and Logics of Reactive Systems, LNCS 194.Google Scholar
  11. [Pr86]
    Pratt, V., Modelling Concurrency with Partial Orders, International Journal of Parallel Programming 15, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Ruurd Kuiper
    • 1
  1. 1.Department of Mathematics and Computing ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations