Skip to main content
Springer Nature Link
Log in

A model for mobile point-to-point data-flow networks without channel sharing

  • Conference
  • Conference paper
  • First Online:
Algebraic Methodology and Software Technology (AMAST 1996)

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

  • 151 Accesses

Abstract

We present a fully abstract, denotational model for mobile, timed, nondeterministic data-flow networks whose components communicate in a point-to-point fashion. In this model components and networks of components are represented by sets of stream processing functions. Each stream processing function is required to be strongly guarded, generic and point-to-point. A stream processing function is strongly guarded if it is contractive with respect to the metric on streams. This property guarantees the existence of unique fix-points. Genericity is a privacy requirement specific to mobile systems. It guarantees that a function never accesses, depends on or sends a port whose name it does not already know. The point-to-point property guarantees that no port is known to more than two components: the sender and the receiver. Our model allows the description of a wide variety of networks — in particular, the description of mobile, unbounded nondeterministic networks. We demonstrate some features of our model by specifying a communication central.

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. G. Agha, I. A. Mason, S. F. Smith, and C. L. Talcott. Towards a theory of actor computation. In Proc. CONCUR'92, Lecture Notes in Computer Science 630, pages 565–579, 1992.

    Google Scholar 

  2. J. D. Brock and W. B. Ackermann. Scenarios: A model of non-determinate computation. In Proc. Formalization of Programming Concepts, Lecture Notes in Computer Science 107, pages 252–259, 1981.

    Google Scholar 

  3. G. Berry and G. Boudol. The chemical abstract machine. In Proc. POPL'90, pages 81–94, 1990.

    Google Scholar 

  4. M. Broy and C. Dendorfer. Modelling operating system structures by timed stream processing functions. Journal of Functional Programming, 2:1–21, 1992.

    Google Scholar 

  5. [BDD+93] M. Broy, F. Dederichs, C. Dendorfer, M. Fuchs, T. F. Gritzner, and R. Weber. The design of distributed systems — an introduction to Focus (revised version). Technical Report SFB 342/2/92 A, Technische Universität München, 1993.

    Google Scholar 

  6. M. Broy. Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing, 2:13–31, 1987.

    Google Scholar 

  7. M. Broy. Advanced component interface specification. In Proc. TPPP'94, Lecture Notes in Computer Science 907, pages 369–392, 1995.

    Google Scholar 

  8. M. Broy. Equations for describing dynamic nets of communicating systems. In Proc. 5th COMPASS Workshop, Lecture Notes in Computer Science 906, pages 170–187, 1995.

    Google Scholar 

  9. K. M. Chandy and J. Misra. Parallel Program Design, A Foundation. Addison-Wesley, 1988.

    Google Scholar 

  10. J. W. de Bakker and J. I. Zucker. Denotational semantics of concurrency. In Proc. 14 ACM Symposium on Theory of Computing, pages 153–158, 1982.

    Google Scholar 

  11. U. Engberg and M Nielsen. A calculus of communicating systems with label-passing. Technical Report DAIMI PB-208, University of Aarhus, 1986.

    Google Scholar 

  12. R. Engelking. General Topology. PWN — Polish Scientific Publishers, 1977.

    Google Scholar 

  13. R. Grosu. A Formal Foundation for Concurrent Object Oriented Programming. PhD thesis, Technische Universität München, 1994. Also available as report TUM-I9444, Technische Universität München.

    Google Scholar 

  14. R. Grosu and K. Stølen. A denotational model for mobile point-to-point dataflow networks. Technical Report SFB 342/14/95 A, Technische Universität München, 1995.

    Google Scholar 

  15. R. Grosu and K. Stølen. A denotational model for mobile many-to-many dataflow networks. To appear as technical report, Technische Universität München, 1996.

    Google Scholar 

  16. R. Grosu and K. Stølen. A denotational model for mobile point-to-point dataflow networks with channel sharing. To appear as technical report, Technische Universität München, 1996.

    Google Scholar 

  17. C. Hewitt, P. Bishop, and R. Steiger. A universal modular actor formalism for artificial intelligence. In Proc. IJCAI'73, pages 235–245, 1973.

    Google Scholar 

  18. G. Kahn. The semantics of a simple language for parallel programming. In Proc. Information Processing 74, pages 471–475. North-Holland, 1974.

    Google Scholar 

  19. R. M. Keller. Denotational models for parallel programs with indeterminate operators. In Proc. Formal Description of Programming Concepts, pages 337–366. North-Holland, 1978.

    Google Scholar 

  20. J. N. Kok. A fully abstract semantics for data flow nets. In Proc. PARLE'87, Lecture Notes in Computer Science 259, pages 351–368, 1987.

    Google Scholar 

  21. J. N. Kok. An iterative metric fully abstract semantics for nondeterministic dataflow. In Proc. MFCS'89, Lecture Notes in Computer Science 379, pages 321–331, 1989.

    Google Scholar 

  22. L. Lamport. The temporal logic of actions. Technical Report 79, Digital, SRC, Palo Alto, 1991.

    Google Scholar 

  23. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Technical Report SRI-CSL-91-05, SRI, 1991.

    Google Scholar 

  24. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I. Information and Computation, 100:1–40, 1992.

    Google Scholar 

  25. D. Park. The “fairness” problem and nondeterministic computing networks. In Proc. 4th Foundations of Computer Science, Mathematical Centre Tracts 159, pages 133–161. Mathematisch Centrum Amsterdam, 1983.

    Google Scholar 

  26. P. Panangaden and V. Shanbhogue. The expressive power of indeterminate dataflow primitives. Information and Computation, 98:99–131, 1992.

    Google Scholar 

  27. J. R. Russell. On oraclizable networks and Kahn's principle. In Proc. POPL'90, pages 320–328, 1990.

    Google Scholar 

  28. B. Thomsen. A calculus of higher order communicating systems. In Proc. POPL'89, 1989.

    Google Scholar 

Download references

Author information

Author notes

  1. Ketil Stølen

    Present address: Institute for Energy Technology, P.O.Box 173, 1751, Halden, Norway

Authors and Affiliations

  1. Institut für Informatik, TU München, Postfach 20 24 20, D-80290, München

    Radu Grosu & Ketil Stølen

Authors
  1. Radu Grosu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ketil Stølen
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ketil Stølen .

Editor information

Martin Wirsing Maurice Nivat

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grosu, R., Stølen, K. (1996). A model for mobile point-to-point data-flow networks without channel sharing. In: Wirsing, M., Nivat, M. (eds) Algebraic Methodology and Software Technology. AMAST 1996. Lecture Notes in Computer Science, vol 1101. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014336

Download citation

  • DOI: https://doi.org/10.1007/BFb0014336

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61463-0

  • Online ISBN: 978-3-540-68595-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation