On fairness in terminating and reactive programs

  • Axel Wabenhorst
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1113)

Abstract

In the setting of boundedly nondeterministic action systems, we give a general definition of the notion of fairness. We provide results that support the top-down development of fair designs and extend them from terminating action systems to non-terminating action systems. One strength of our approach is the similarity of the results to those used for the standard developments. Another is the generality of the notion of fairness which it captures.

Keywords

Action System Action Sequence Proof Rule Nondeterministic Choice Weak Precondition 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Bac89]
    R. J.R. Back, A Method of Refining Atomicity in Parallel Algorithms, LNCS 366, Springer Verlag, 1989Google Scholar
  2. [BM95]
    M.J. Butler, C.C. Morgan, Action Systems, Unbounded Nondeterminism, and Infinite Traces, Formal Aspects of Computing, Vol. 7, 1995Google Scholar
  3. [Boo82]
    H.J. Boom, A Weaker Precondition for Loops, ACM Transactions on Programming Languages and Systems, Vol.4, 1982Google Scholar
  4. [BX95]
    R.J.R. Back, Q.W. Xu, Fairness in Action Systems, unpublished, 1995Google Scholar
  5. [CM88]
    K.M. Chandy, J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988Google Scholar
  6. [DS90]
    E.W. Dijkstra, C.S. Scholten, Predicate Calculus and Program Semantics, Springer-Verlag, 1990Google Scholar
  7. [Fra86]
    N. Francez, Fairness, Springer Verlag, 1986Google Scholar
  8. [Hes95]
    W.H. Hesselink, Safety and Progress of Recursive Procedures, Formal Aspects of Computing, Vol. 7, 1995Google Scholar
  9. [MMSS95]
    C.C. Morgan, A.K. McIver, K. Seidel, J.W. Sanders, Probabilistic Predicate Transformers, Technical Report TR-4-95, Programming Research Group, Oxford University Computing Laboratory, 1995Google Scholar
  10. [Mor90]
    J.M. Morris, Temporal Predicate Transformers and Fair Termination, Acta Informatica, Vol. 27, 1990Google Scholar
  11. [MP92]
    Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, 1992Google Scholar
  12. [Wab96]
    A.K. Wabenhorst, Developing Fairness in Terminating and Reactive Programs, Technical Report TR-1-96, Programming Research Group, Oxford University, 1996, http://www.comlab.ox.ac.uk/oucl/publications/tr/TR-l-96.htmlGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Axel Wabenhorst
    • 1
  1. 1.Programming Research GroupOxford University Computing LaboratoryOxfordUK

Personalised recommendations