Toggle Main Menu Toggle Search

Open Access padlockePrints

Adequacy-preserving Transformatics of COSY Path Programs

Lookup NU author(s): Professor Maciej KoutnyORCiD



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 Pinto 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.

Publication metadata

Author(s): Koutny M

Publication type: Report

Publication status: Published

Series Title: Computing Laboratory Technical Report Series

Year: 1988

Pages: 32

Report Number: 270

Institution: Computing Laboratory, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne