Introducing fairness in CSP systems specified with state variables
A framework is presented to show formally that a parallel system is fair with respect to any set of events. Systems are specified by means of a set of variables, a set of guarded transitions and a set of liveness conditions, using an already presented technique [PA93]. Their semantics are given in the CSP model [BRH84]. The proofs use normal predicate logic and noetherian induction. Invariants are an important piece of information in the development of the proofs. A non trivial case study is developed.
keywordsdesign of parallel programs specification verification formal development methodologies semantics
Unable to display preview. Download preview PDF.
- [AO91]K.R. Apt and E.-R. Olderog. Verification of sequential and concurrent programs. Springer-Verlag, 1991.Google Scholar
- [CM88]K.M. Chandy and J. Misra. Parallel Program Design: A Foundation. Addison Wesley, Reading, Ma, 1988.Google Scholar
- [Fra86]N. Francez. Fairness. Springer-Verlag, 1986.Google Scholar
- [PA93]R. Peña and L.M. Alonso. A technique for specifying and refining TCSP processes by using guards and liveness conditions. In M.-C. Gaudel and J.P. Jouannaud, editors, TAPSOFT'93, pages 328–342. Springer-Verlag, 1993. LNCS 668.Google Scholar
- [PG94]R. Peña and L.A. Galán. Introducing fairness in CSP systems specified with state variables. Technical Report DIA-UCM 94/1, Universidad Complutense de Madrid, 1994.Google Scholar