Browse by author
Lookup NU author(s): Professor Eike Best
Syntax and semantics of a subset of the path notation are introduced. Then a property of path programs called adequacy is defined; roughly, programs are adequate if there is no partial deadlock. Fianlly, 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. An overview of the results on adequacy which have been obtained so far is also given. Even so, this is intended to serve as an introductory text.
Author(s): Best E
Publication type: Report
Publication status: Published
Series Title: Computing Laboratory Technical Report Series
Year: 1980
Pages: 24
Print publication date: 01/01/1980
Source Publication Date: January 1980
Report Number: 146
Institution: Computing Laboratory, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
URL: http://www.cs.ncl.ac.uk/publications/trs/papers/146.pdf
