Where academic tradition
meets the exciting future

Refinement of Fair Action Systems

Ralph-Johan Back, Qiwen W. Xu, Refinement of Fair Action Systems. Acta Informatica 35, 1997.

Abstract:

An action system is a framework for describing parallel or
distributed
systems, for which the refinement calculus offers a formalisation
of the stepwise development method. Fairness is an important notion
in modelling parallel or distributed systems, and this paper investigates
a calculus for refinement of fair action systems. Simulations, which
are proof techniques for refinement, are extended to verify fair
action systems. Our work differs from others’ in that the additional
condition concerning fairness is expressed through termination of
related iteration statements. For this purpose, existing proof rules
for termination are extended. In the tradition of the refinement
calculus, our approach to fairness is based on techniques developed
mainly for sequential programming.

Files:

Full publication in PDF-format

BibTeX entry:

@ARTICLE{jBaXu97,
  title = {Refinement of Fair Action Systems},
  author = {Back, Ralph-Johan and Xu, Qiwen W.},
  journal = {Acta Informatica},
  volume = {35},
  year = {1997},
}

Belongs to TUCS Research Unit(s): Software Construction Laboratorium

Publication Forum rating of this publication: level 2

Edit publication