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.
CITATION STYLE
Wabenhorst, A. (1996). On fairness in terminating and reactive programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1113, pp. 554–565). Springer Verlag. https://doi.org/10.1007/3-540-61550-4_178
Mendeley helps you to discover research relevant for your work.