Browse by author
Lookup NU author(s): Professor Eike Best
Full text is not currently available for this publication.
This report contains an introduction to the COSY notation and its associated formalism. COSY is a language derived from regular expressions, whole objects, COSY programs, may be considered as abstractly specifying systems, which are possibly highly parallel and distributed. Within the framework of such a formalism, it becomes possible to rigorously define important system properties, such as freedom from deadlock, adequacy and starvation, and to analyse programs for the presence or absence of such properties. The report begins by introducing the notion of system underlying the COSY approach and continues by gradually introducing the notation, illustrating each step with examples. Then follows a discussion of the relationship between COSY programs and Petri nets via a modification of the net semantics for COSY programs of [LC75]. Next, we present some results which support the formal analysis of programs to determine absence or presence of adequacy and freedom fro deadlock. The final section contains a summary, together with suggestions for modifications and extensions, of the work reported here. There are two technical appendices.
Author(s): Lauer PE, Shields MW, Best E
Publication type: Report
Publication status: Published
Series Title: Computing Laboratory Technical Report Series
Year: 1979
Print publication date: 01/01/1979
Source Publication Date: 1979
Report Number: 142
Institution: Computing Laboratory, University of Newcastle upon Tyne
Place Published: Newcastle upon Tyne
