Adequacy properties of path programs

Syntax and semantics of a subset of the path notation are introduced. Then a property of path programs called adequacy is defined; adequacy corresponds to the absence of partial deadlock. Two results are presented concerning adequacy. The first result solves the adequacy problem for a certain subclass of programs, and the second result characterises the problem in terms of PT-nets for another subclass. Finally, an overview of similar results which have been obtained so far is given. There is an appendix containing some definitions and results about PT-nets, pertaining to the relationship between subclasses of nets.