Adequacy-Preserving Transformations of COSY Path Programs

Koutny, M

doi:10.1007/3-540-50403-6_51

Adequacy-Preserving Transformations of COSY Path Programs

Lookup NU author(s): Professor Maciej Koutny ORCiD

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.

Abstract

We here investigate a transformation of COSY path programs which is a replacement of a single event in one path program Q by another path program P. Such a transformation, called insertion, closely corresponds to refining an atomic action into several more elementary actions. In general, the path program resulting from the insertion of P into Q has quite different behavioural properties than do P and Q. Therefore, in order to be able to use insertions as a verification tool it is necessary to develop a set of rules which would guarantee the preservation of various important properties through the insertion. One of such properties is adequacy which is a property capturing the absence of partial deadlocks in a system. In this paper we present some sufficient conditions for adequacy-preserving insertion. Also, we fully characterise the set of all those programs P for which insertion is always adequacy-preserving.