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

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1101, Issue , 1996, Pages 504-519

  Grosu, Radu ^a   Stølen, Ketil ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; DATA TRANSFER; SOFTWARE ENGINEERING;

CHANNEL SHARING; DENOTATIONAL MODELS; MODEL COMPONENTS; NON-DETERMINISTIC DATUM; NON-DETERMINISTIC NETWORKS; POINT TO POINT; PRIVACY REQUIREMENTS; STREAM PROCESSING;

DATA FLOW ANALYSIS;

EID: 21344435914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0014336     Document Type: Conference Paper

References (28)

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.
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.
3. G. Berry and G. Boudol. The chemical abstract machine. In Proc. POPL'90, pages 81-94, 1990.
4. M. Broy and C. Dendorfer. Modelling operating system structures by timed stream processing functions. Journal of Functional Programming, 2:1-21, 1992.
5. 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.
6. M. Broy. Semantics of finite and infinite networks of concurrent communicating agents. Distributed Computing, 2:13-31, 1987.
7. M. Broy. Advanced component interface specification. In Proc. TPPP'94, Lecture Notes in Computer Science 907, pages 369-392, 1995.
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.
9. K. M. Chandy and J. Misra. Parallel Program Design, A Foundation. Addison-Wesley, 1988.
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.
11. U. Engberg and M Nielsen. A calculus of communicating systems with label-passing. Technical Report DAIMI PB-208, University of Aarhus, 1986.
12. R. Engelking. General Topology. PWN - Polish Scientific Publishers, 1977.
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.
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.
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.
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.
17. C. Hewitt, P. Bishop, and R. Steiger. A universal modular actor formalism for artificial intelligence. In Proc. IJCAI'73, pages 235-245, 1973.
18. G. Kahn. The semantics of a simple language for parallel programming. In Proc. Information Processing 74, pages 471-475. North-Holland, 1974.
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.
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.
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.
22. L. Lamport. The temporal logic of actions. Technical Report 79, Digital, SRC, Palo Alto, 1991.
23. J. Meseguer. Conditional rewriting logic as a unified model of concurrency. Technical Report SRI-CSL-91-05, SRI, 1991.
24. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, part I. Information and Computation, 100:1-40, 1992.
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.
26. P. Panangaden and V. Shanbhogue. The expressive power of indeterminate dataflow primitives. Information and Computation, 98:99-131, 1992.
27. J. R. Russell. On oraclizable networks and Kahn's principle. In Proc. POPL'90, pages 320-328, 1990.
28. B. Thomsen. A calculus of higher order communicating systems. In Proc. POPL'89, 1989.