Toggle Main Menu Toggle Search

Open Access padlockePrints

Formal Theory of the Basic COSY Notation

Lookup NU author(s): Professor Eike Best

Downloads

Full text is not currently available for this publication.


Abstract

This report records work done on the formal analysis of basic COSY notation in the period 1976-77. In the first part, the notation is formally defined and equipped with a semantics in terms of transition nets. Subnotations of the notations are defined and related to interesting subclasses of transition nets. In particular, it is shown that comma-free programs correspond to the class of safe simple nets. The second part of the report contains results relating to adequacy, a system property akin to freedom from partial system deadlock. The report ends with a discussion of the problems involved in incorporating the Kleene star into the notation. Salient technical details have been collected into an appenidx.


Publication metadata

Author(s): Lauer PE, Shields MW, Best E

Publication type: Report

Publication status: Published

Series Title: Computing Laboratory Technical Report Series

Year: 1979

Report Number: 143

Institution: Computing Laboratory, University of Newcastle upon Tyne

Place Published: Newcastle upon Tyne

URL: http://www.cs.ncl.ac.uk/publications/trs/abstract/143


Share