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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
R. J.R. Back, A Method of Refining Atomicity in Parallel Algorithms, LNCS 366, Springer Verlag, 1989
M.J. Butler, C.C. Morgan, Action Systems, Unbounded Nondeterminism, and Infinite Traces, Formal Aspects of Computing, Vol. 7, 1995
H.J. Boom, A Weaker Precondition for Loops, ACM Transactions on Programming Languages and Systems, Vol.4, 1982
R.J.R. Back, Q.W. Xu, Fairness in Action Systems, unpublished, 1995
K.M. Chandy, J. Misra, Parallel Program Design: A Foundation, Addison-Wesley, 1988
E.W. Dijkstra, C.S. Scholten, Predicate Calculus and Program Semantics, Springer-Verlag, 1990
N. Francez, Fairness, Springer Verlag, 1986
W.H. Hesselink, Safety and Progress of Recursive Procedures, Formal Aspects of Computing, Vol. 7, 1995
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, 1995
J.M. Morris, Temporal Predicate Transformers and Fair Termination, Acta Informatica, Vol. 27, 1990
Z. Manna, A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems, Springer-Verlag, 1992
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.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wabenhorst, A. (1996). On fairness in terminating and reactive programs. In: Penczek, W., Szałas, A. (eds) Mathematical Foundations of Computer Science 1996. MFCS 1996. Lecture Notes in Computer Science, vol 1113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61550-4_178
Download citation
DOI: https://doi.org/10.1007/3-540-61550-4_178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61550-7
Online ISBN: 978-3-540-70597-0
eBook Packages: Springer Book Archive