Skip to main content
SpringerLink
Log in

A calculus of value broadcasts

  • Paper Sessions
  • Conference paper
  • First Online:
PARLE '93 Parallel Architectures and Languages Europe (PARLE 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 694))

Abstract

Computation can be modelled as a sequence of values, each broadcast by one agent and instantaneously audible to all those in parallel with it. Listening agents receive the value; others lose it. Subsystems interface via translators; these can scramble values and thus hide or restrict them. Examples show the calculus describing this model to be a powerful and natural programming tool. Weak bisimulation, a candidate for observational equivalence, is defined on the basis that receiving a value can be matched by losing it.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Samson Abramsky. Observation equivalence as a testing equivalence. Theoretical Computer Science, 53, 1987.

    Google Scholar 

  2. Lennart Augustsson and Thomas Johnsson. Lazy ML user's manual. Technical report, Department of Computer Science, Chalmers University of Technology, 1992.

    Google Scholar 

  3. Kenneth Birman and Robert Cooper. The ISIS project: Real experience with a fault tolerant programming system. Operating Systems Review, 25(2), April 1991.

    Google Scholar 

  4. Dave Berry, Robin Milner, and David Turner. A semantics for ML concurrency primitives. In Symposium on Principles of Programming Languages. ACM, 1992.

    Google Scholar 

  5. Rance Cleaveland and Matthew Hennessy. Priorities in process algebras. In Symposium on Logic in Computer Science. IEEE, 1988.

    Google Scholar 

  6. Rina Dechter and Leonard Kleinrock. Broadcast communications and distributed algorithms. IEEE Trans. on Computers, 35(3):418, Mar 1986.

    Google Scholar 

  7. Alessandro Giacalone, Prateek Mishra, and Sanjeev Prasad. Facile: A symmetric integration of functional and concurrent programming. International Journal of Parallel Programming, 18(2), 1989.

    Google Scholar 

  8. J.F. Groote. Transition system specifications with negative premises. In CONCUR '90, 1990. Springer Verlag LNCS 458.

    Google Scholar 

  9. Matthew Hennessy. A proof system for communicating processes with value-passing. Formal Aspects of Computer Science, 3:346–366, 1991.

    Google Scholar 

  10. Sören Holmström. PFL: A functional language for parallel programming. Technical Report 7, Dept. of Computer Sciences, Chalmers Univ. of Tech., 1983.

    Google Scholar 

  11. Tzung-Pei Hong and Shian-Shyong Tseng. Parallel perceptron learning on a single-channel broadcast communication model. Parallel Computing, 18:133–148, 1992.

    Article  Google Scholar 

  12. Simon Jones. Translating CBS to LML. Technical report, Department of Computer Science, University of Stirling, 1992.

    Google Scholar 

  13. 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. Robin Milner. Communication and Concurrency. Prentice Hall, 1989.

    Google Scholar 

  15. Jenny Petersson. Tools for CBS. Licentiate thesis, Department of Computer Science, Chalmers University of Technology, 1993. In preparation.

    Google Scholar 

  16. K. V. S. Prasad. Bisimulations induced by preorders on action sequences. In Chalmers Workshop On Concurrency, May 1991.

    Google Scholar 

  17. K. V. S. Prasad. A calculus of broadcasting systems. In TAPSOFT'91 Volume 1: CAAP, April 1991. Springer Verlag LNCS 493.

    Google Scholar 

  18. K. V. S. Prasad. Broadcasting with priority. Technical report, Department of Computer Science, Chalmers University of Technology, 1993.

    Google Scholar 

  19. K. V. S. Prasad. Programming with broadcasts. Technical report, Department of Computer Science, Chalmers University of Technology, 1993.

    Google Scholar 

  20. Peter Sjödin. From LOTOS specifications to distributed implementations. PhD thesis, Uppsala University, December 1991.

    Google Scholar 

  21. Frits Vaandrager. On the relationship between process algebra and input/output automata. 6th Annual Symposium on Logic in Computer Science, 1991.

    Google Scholar 

  22. Chang-Biau Yang, R. C. T. Lee, and Wen-Tsuen Chen, Parallel graph algorithms based upon broadcast communications. IEEE Trans. on Computers, 39(12):1468, Dec 1990.

    Article  Google Scholar 

Download references

Author information

Author notes

  1. K. V. S. Prasad

    Present address: Department of Computer Sciences, Chalmers University of Technology, S-412 96, Gothenburg, Sweden

Authors and Affiliations

    Authors
    1. K. V. S. Prasad
      View author publications

      You can also search for this author in PubMed Google Scholar

    Corresponding author

    Correspondence to K. V. S. Prasad .

    Editor information

    Arndt Bode Mike Reeve Gottfried Wolf

    Rights and permissions

    Reprints and permissions

    Copyright information

    © 1993 Springer-Verlag Berlin Heidelberg

    About this paper

    Cite this paper

    Prasad, K.V.S. (1993). A calculus of value broadcasts. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_31

    Download citation

    • DOI: https://doi.org/10.1007/3-540-56891-3_31

    • Published:

    • Publisher Name: Springer, Berlin, Heidelberg

    • Print ISBN: 978-3-540-56891-9

    • Online ISBN: 978-3-540-47779-2

    • eBook Packages: Springer Book Archive

    Publish with us

    Policies and ethics

    Search

    Navigation