COSY: Its relation to nets and to CSP

  • Eike Best
Section 8 Relationship To Other Models Of Concurrency
Part of the Lecture Notes in Computer Science book series (LNCS, volume 255)


COSY is an abstract programming notation ‘between’ Petri nets and concurrent programs. It allows to analyse the interrelationship of atomic actions, abstracting away from their internal structure. This paper describes control programs, a dialect of COSY, and some of their theory. It exhibits their relationship to Petri nets and shows how a simplified version of CSP can be given a semantics in terms of control programs (and hence also in terms of nets). Amongst other things, this yields a ‘true concurrency’ semantics of CSP.


Control Program Transition Sequence Concurrent Program Springer Lecture Note Sequential Component 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    T.S. Anantharaman, E.M. Clarke, M.J. Foster and B. Mishra: Compiling Path Expressions into VLSI Circuits. Distributed Computing 1, 150–166 (1986).CrossRefGoogle Scholar
  2. [2]
    K.R. Apt, N. Francez and W.P. de Roever: A Proof System for Communicating Sequential Processes. ACM TOPLAS, Vol.2, No.3, 361–385 (1980).Google Scholar
  3. [3]
    E. Best: Adequacy Properties of Path Programs. TCS Vol.18, 149–171 (1982).Google Scholar
  4. [4]
    E.Best: Structure Theory of Petri Nets: The Free Choice Hiatus. These Notes.Google Scholar
  5. [5]
    E.Best and R.Devillers: Concurrent Behaviour: Sequences, Processes and Programming Languages. GMD-Studien No.99 (May 1985). Revised version to appear in TCS (1987). Also: E.Best: Concurrent Behaviour: Sequences, Processes and Axioms. Springer Lecture Notes in Computer Science Vol.197, 221–245 (1985).Google Scholar
  6. [6]
    E.Best and C.Fernández: Notations and Terminology on Petri Net Theory. Arbeitspapiere der GMD No.195 (1986). Also: Petri Net Newsletters No.23, 21–46 (April 1986).Google Scholar
  7. [7]
    E.Best and C.Fernández: A Petri Net Theory of Processes and Systems. Manuscript (1987).Google Scholar
  8. [8]
    R.H. Campbell and A.N. Habermann: The Specification of Process Synchronisation by Path Expressions. Springer Lecture Notes in Computer Science, Vol.16, 89–102 (1974).Google Scholar
  9. [9]
    E. Chang and R. Roberts: An Improved Algorithm for Decentralised Extrema-Finding in Circular Configurations of Processes. CACM Vol.22(5), 281–283 (1979).Google Scholar
  10. [10]
    J.W. de Bakker and J. Zucker: Processes and the Denotational Semantics of Concurrency. Information and Control Vol.54 No.1/2, 70–120 (1982).CrossRefGoogle Scholar
  11. [11]
    F.De Cindio, G.De Michelis, L.Pomello and C.Simone: A Petri Net Model for CSP. Proc. CIL'81, Barcelona (1981).Google Scholar
  12. [12]
    E.W.Dijkstra: A Discipline of Programming. Prentice Hall (1976).Google Scholar
  13. [13]
    C.Fernández: Non-sequential Processes. These Notes.Google Scholar
  14. [14]
    U. Goltz and W. Reisig: CSP Programs as Nets with Individual Tokens. Springer Lecture Notes in Computer Science Vol.188, 169–196 (1985).Google Scholar
  15. [15]
    D.Hillen: Ein nebenläufiger Kalkül für CSP-ähnliche Sprachen. Arbeitspapiere der GMD No.222 (September 1986).Google Scholar
  16. [16]
    C.A.R. Hoare: Communicating Sequential Processes. CACM Vol.21(8), 666–677 (1978).Google Scholar
  17. [17]
    R. Janicki: Transforming Sequential Systems into Concurrent Systems. TCS 36, 27–58 (1985).Google Scholar
  18. [18]
    R. Janicki: An Equivalence Notion for Path Expression Systems. EIK 21/6, 283–295 (1985).Google Scholar
  19. [19]
    R.Janicki, P.E.Lauer, M.Koutny and R.Devillers: Concurrent and Maximally Concurrent Evolution of Non-sequential Systems. Aalborg Universitetscenter Technical Report R85-6 (1985), also to appear in TCS.Google Scholar
  20. [20]
    P.E. Lauer: Synchronisation of Concurrent Processes without Globality Assumptions. ACM SIGPLAN Notices 16(9), 66–80 (1981).Google Scholar
  21. [21]
    P.E. Lauer and R.H. Campbell: Formal Semantics for a Class of High-level Primitives for Coordinating Concurrent Processes. Acta Informatica, Vol.5, 247–332 (1975).CrossRefGoogle Scholar
  22. [22]
    P.E. Lauer, M.W.Shields and E.Best: Formal Theory of the Basic COSY Notation. TR 143, Computing Laboratory, University of Newcastle upon Tyne (1978).Google Scholar
  23. [23]
    P.E. Lauer, M.W. Shields and E. Best: Design and Analysis of Highly Parallel and Distributed Systems. Springer Lecture Notes in Computer Science, Vol.86, 451–503 (1980).Google Scholar
  24. [24]
    P.E. Lauer, P.R. Torrigiani and M.W. Shields: COSY—A System Specification Language Based on Paths and Processes. Acta Informatica, Vol.12, 109–158 (1979).CrossRefGoogle Scholar
  25. [25]
    A.Mazurkiewicz: Trace theory. These Notes.Google Scholar
  26. [26]
    R.Milner: A Calculus of Communicating Systems. Springer Lecture Notes in Computer Science, Vol.92 (1980).Google Scholar
  27. [27]
    E.R.Olderog: TCSP: Theory of Communicating Sequential Processes. These Notes.Google Scholar
  28. [28]
    W.Reisig: Place/transition Systems. These Notes.Google Scholar
  29. [29]
    M.Rem: Concurrent Computations and VLSI Circuits. In: Control Flow and Data Flow: Concepts of Distributed Programming (ed. M.Broy), Springer Verlag, 399–437 (1985).Google Scholar
  30. [30]
    G.Rozenberg: Behaviour of Elementary Net Systems. These Notes.Google Scholar
  31. [31]
    M.W. Shields: Adequate Path Expressions. Springer Lecture Notes in Computer Science, Vol.70, 249–265 (1979).Google Scholar
  32. [32]
    M.W.Shields: On the Non-sequential Behaviour of Systems Possessing a Generalised Free Choice Property. Report CRS-92-81, Department of Computer Science, University of Edinburgh (1981).Google Scholar
  33. [33]
    M.W. Shields: Nonsequential Behaviour. Springer Lecture Notes in Computer Science, Vol.167, 229–239 (1984).Google Scholar
  34. [34]
    M.W. Shields: Concurrent Machines. The Computer Journal, Vol.28, No.5, 449–465 (1985).Google Scholar
  35. [35]
    Jan L.A. van de Snepscheut: Trace Theory and VLSI Design. Springer Lecture Notes in Computer Science, Vol.200 (1985).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Eike Best
    • 1
  1. 1.Institut für methodische GrundlagenGesellschaft für Mathematik und DatenverarbeitungSt.Augustin

Personalised recommendations