Lookup NU author(s): Professor Maciej Koutny
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
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.
Author(s): Koutny M
Editor(s): Vogt, F.H.
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: International Conference on Concurrency (Concurrency)
Year of Conference: 1988
ISSN: 0302-9743 (Print) 1611-3349 (Online)
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science