NAPAW 92 pp 27-40 | Cite as

Process Communication Environment

  • Damas P. Gruska
  • Andrea Maggiolo-Schettini
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

A real time extension of CCS which takes into account properties of an interconnection communication network is presented. With the help of this calculus several semantics for CCS are defined. Limitations of CCS are discussed.

Keywords

Prefix Elementary Action Klop 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.A. Bergstra and J.W. Klop, Algebra of communicating processes with abstraction, Theoretical Computer Science, 37, pp. 77–21, 1985.MathSciNetMATHCrossRefGoogle Scholar
  2. [2]
    U. Black, Computer Networks, Prentice-Hall International, New York, 1987.Google Scholar
  3. [3]
    J.F. Groote, Transition systems specification with negative premises, In CONCUR’90, LNCS 458, pp. 332–341, 1990.MathSciNetGoogle Scholar
  4. [4]
    J.F. Groote, Specification and verification of real time systems in ACP, Technical report CS-R9015, CWI, Amsterdam, 1990.Google Scholar
  5. [5]
    D.P. Gruska and A. Maggiolo-Schettini, A timed process description language based on CCS, Technical Report TR-9/91, Dipartimento di Informatica, Università di Pisa, 1991.Google Scholar
  6. [6]
    D.P. Gruska and A. Maggiolo-Schettini, Net semantics for communicating processes, Technical Report 8/92, Institute of Informatics, Comenius University, 1992.Google Scholar
  7. [7]
    M. Hennessy and T. Regan, A temporal process algebra, In FORTE ‘80, Third International Conference on Formal Description Techniques, Madrid, November 5–8, pp. 25–40, 1990.Google Scholar
  8. [8]
    C.A.R. Hoare, Communicating Sequential Processes,Prentice-Hall International, New York,1985.MATHGoogle Scholar
  9. [9]
    H. Hansson and B. Jonsson, A calculus for communicating systems with time and probabilities, In Proceedings of 11th IEEE Real - Time Systems Symposium, Orlando, 1990.Google Scholar
  10. [10]
    R. Milner, Communication and Concurrency,Prentice-Hall International, New York,1989.MATHGoogle Scholar
  11. [11]
    F. Moller and C. Tofts, A temporal calculus of communicating programs, In CONCUR’90, LNCS 458, pp. 401–415, 1990.MathSciNetGoogle Scholar
  12. [12]
    C. Weitzman, Distributed Mocro/Minicomputer Systems,Prentice-Hall International, New York,1980.Google Scholar
  13. [13]
    W. Yi, CCS+time = an interleaving model for real time systems, In ICALP’91, LNCS 510, pp. 217–228, 1991.Google Scholar

Copyright information

© British Computer Society 1993

Authors and Affiliations

  • Damas P. Gruska
    • 1
  • Andrea Maggiolo-Schettini
    • 2
  1. 1.Institute of InformaticsComenius UniversityBratislavaCzecho-Slovakia
  2. 2.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations