Advertisement

Broadcasting with priority

  • K. V. S. Prasad
Contributed Papers
Part of the Lecture Notes in Computer Science book series (LNCS, volume 788)

Abstract

Adding priorities to CCS is difficult, and involves two-stage operational semantics or other complications. By contrast, priorities can be added very simply to a calculus of broadcasting systems (CBS). The reason is the input/output distinction made in CBS, with output actions being autonomous. Priority makes sense only for autonomous actions.

As in unprioritised CBS, both strong and weak bisimulation are congruences, and capture the intuitively desired equivalences. CBS is also a powerful and natural language, offering an interesting new programming paradigm. Several examples show that priorities extend both the power and the paradigm.

Key words and phrases

Broadcast priority process calculi bisimulation functional programming 

References

  1. [AJ93]
    Lennart Augustsson and Thomas Johnsson. Lazy ML user's manual. Technical report, Department of Computer Science, Chalmers University of Technology, 1993.Google Scholar
  2. [BA90]
    M. Ben-Ari. Principles of Concurrent and Distributed Programming. Prentice-Hall, 1990.Google Scholar
  3. [BBK85]
    J. C. M. Baeten, J. A. Bergstra, and J. W. Klop. Syntax and defining equations for an interrupt mechanism in process algebra. Technical Report CSR8503, Centre for Mathematics and Computer Science, Amsterdam, 1985.Google Scholar
  4. [BG92]
    Gérard Berry and Georges Gonthier. The ESTEREL synchronous programming language: Design, semantics, implementation. Science of Computer Programming, 19, 1992.Google Scholar
  5. [BM91]
    J.-P. Banâtre and D. Le Metayer, editors. Research Directions in High-Level Parallel Programming Languages. Springer Verlag LNCS 574, 1991.Google Scholar
  6. [Bur88]
    F. W. Burton. Nondeterminism with referential transparency in functional languages. The Computer Journal, 31(3):243–247, 1988.Google Scholar
  7. [CC93]
    Linda Christoff and Ivan Christoff. Observational equivalence for processes with priorities. Technical report, Dept. of Computer Systems, Uppsala Univ., 1993.Google Scholar
  8. [CG89]
    Nicholas Carriero and David Gelernter. Linda in context. Communications of the ACM, 32(4):444–458, April 1989.Google Scholar
  9. [CH88]
    Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. In Symposium on Logic in Computer Science. IEEE, 1988.Google Scholar
  10. [CW91]
    Juanito Camilleri and Glynn Winskel. CCS with priority choice. In Symposium on Logic in Computer Science. IEEE, 1991.Google Scholar
  11. [Har87]
    David Harel. Statecharts: A visual formalism for complex systems. Science of Computer Programming, 8, 1987.Google Scholar
  12. [Jef92]
    Alan Jeffrey. Translating timed process algebra into prioritised process algebra. In Nijmegen Symposium on Real-Time and Fault-Tolerant Systems, 1992.Google Scholar
  13. [LT87]
    Nancy Lynch and Mark Tuttle. Hierarchical correctness proofs for distributed algorithms. Technical Report MIT/LCS/TR-387, Laboratory for Computer Science, Massachusetts Institute of Technology, 1987.Google Scholar
  14. [Mil89]
    Robin Milner. Communication and Concurrency. Prentice Hall, 1989.Google Scholar
  15. [Pra91]
    K. V. S. Prasad. A calculus of broadcasting systems. In TAPSOFT'91 Volume 1: CAAP, April 1991. Springer Verlag LNCS 493.Google Scholar
  16. [Pra93a]
    K. V. S. Prasad. Broadcasting in time. Technical report, Department of Computer Science, Chalmers University of Technology, 1993.Google Scholar
  17. [Pra93b]
    K. V. S. Prasad. A calculus of value broadcasts. In PARLE'93, June 1993. Springer Verlag LNCS 694.Google Scholar
  18. [Pra93c]
    K. V. S. Prasad. Programming with broadcasts. In CONCUR'93, August 1993. Springer Verlag LNCS 715.Google Scholar
  19. [RW93]
    C. Runciman and D. Wakeling. Profiling parallelism. Internal report, Department of Computer Science, University of York, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  1. 1.Department of Computing ScienceChalmers University of TechnologyGothenburgSweden

Personalised recommendations