Categorical models of process cooperation

  • A. Labella
  • A. Pettorossi
Part II Research Contributions Section 1: Semantics
Part of the Lecture Notes in Computer Science book series (LNCS, volume 240)


Categorical Semantic Parallel Composition Derivation Tree Free Monoid Derivation Rule 
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]
    Austry, D. and Boudol, G.: "Algèbre de Processus et Sychronisation" Theoretical Computer Science 30 (1984) 91–131.Google Scholar
  2. [2]
    Brookes, S.D.: "On the Relationship of CCS and CSP". Proc. ICALP 83 LNCS. n. 154 (ed. J. Díaz) Springer Verlag (1983), 83–96.Google Scholar
  3. [3]
    Brookes, S.D., Hoare, C.A.R., and Roscoe, A.W.: "A Theory of Communicating Sequential Processes" J.A.C.M. 31, 3 (1984) 560–599.Google Scholar
  4. [4]
    Bergstra, J.A. and Klop, J.W.: "Process Algebra for Synchronous Communication". Information and Control 60 (1984) 109–137.Google Scholar
  5. [5]
    De Nicola, R.: "Testing Equivalence and Fully Abstract Models for Communicating Processes". Ph.D. Thesis. Edinburgh University. (1986).Google Scholar
  6. [6]
    Degano, P. and Montanari, U.: "Specification Languages for Distributed Systems". Proc. Mathematical Foundations of Software Development LNCS n. 185 Springer Verlag, Berlin (1985) 29–51.Google Scholar
  7. [7]
    Hoare, C.A.R.: "Communicating Sequential Processes" Comm. A.C.M. Vol. 21 n. 8 (1978) 666–677.Google Scholar
  8. [8]
    Hennessy, M.: "Synchronous and Asynchronous Experiments on Processes" Information and Control 59 (1983) 36–83.Google Scholar
  9. [9]
    Labella, A. and Pettorossi, A.: "Categorical Models for Hand-shaking Communications" Annales Societatis Mathematicae Polonae Series IV: Fundamenta Informaticae VIII.3–4 Warsaw (Poland) (1985), 323–357.Google Scholar
  10. [10]
    Mazurkiewicz, A.: "Concurrent Program Schemes and their Interpretations" DAIMI PB 78 Aarhus University Publ. (1978).Google Scholar
  11. [11]
    Milner, R.: "A Calculus of Communicating Systems" LNCS n. 92 Springer Verlag, Berlin (1980).Google Scholar
  12. [12]
    Milner, R.: "Calculi for Synchrony and Asynchrony" Theoretical Computer Science 25 (1983) 267–310.Google Scholar
  13. [13]
    Winkowski, J.: "Towards an Algebraic Description of Discrete Processes and Systems". ICS PAS Report n. 408, Warsaw Poland (April 1980).Google Scholar
  14. [14]
    Winskel, G.: "Synchronization Trees". LNCS n. 154 Proc. ICALP 83 Springer Verlag (1983), pp.695–711.Google Scholar
  15. [15]
    Winskel, G.: "Categories of Models for Concurrency". LNCS.197 Seminar on Concurrency. Carnegie-Mellon University, Pittsburgh July 9–11, 1984. Springer Verlag (1985) 246–267.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • A. Labella
    • 1
  • A. Pettorossi
    • 2
  1. 1.Dipartimento di MatematicaUniversità La SapienzaRomaItaly
  2. 2.IASI — CNRRomaItaly

Personalised recommendations