A compositional model for confluent dynamic data-flow networks

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

Volumn 1893, Issue , 2000, Pages 212-221

  de Boer, Frank S ^a   Bonsangue, Marcello M ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; SEMANTICS;

COMPOSITIONAL CHARACTERIZATION; COMPOSITIONAL MODELING; DYNAMIC DATA; OPERATIONAL SEMANTICS; PARTIAL CORRECTNESS; STATE BASED;

DATA FLOW ANALYSIS;

EID: 84959238916     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44612-5_17     Document Type: Conference Paper

References (17)

1. G. Agha, I. Mason, S. Smith, and C. Talcott. A foundation for actor computation Journal of Functional Programming, 1(1):1-69, 1993.
2. R. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulations for the Asynchronous calculus. Theoretical Computer Science, 195:291-324, 1998.
3. F. Arbab, F.S. de Boer, and M.M. Bonsangue. A coordination language for mobile components. In Proc. of SAC 2000, pp. 166-173, ACM press, 2000.
4. F. Arbab, I. Herman, and P. Spilling. An overview of Manifold and its implementation. Concurrency: Practice and Experience, 5(1):23-70, 1993.
5. F.S. de Boer. Reasoning about asynchronous communication in dynamically evolving object structures. To appear in Theoretical Computer Science, 2000.
6. M. Broy. Equations for describing dynamic nets of communicating systems. In Proc. 5th COMPASS workshop, vol. 906 of LNCS, pp. 170-187, 1995.
7. L. Cardelli and A.D. Gordon. Mobile ambients. In Proc. of Foundation of Software Science and Computational Structures, vol. 1378 of LNCS, pp. 140-155, 1998.
8. E.W. Dijkstra. A Discipline ofProgramming. Prentice-Hall, 1976.
9. M. Falaschi, M. Gabbrielli, K. Marriot, and C. Palamidessi. Confluence in concurrent constraint programming. In Theoretical Computer Science, 183(2), 1997.
10. C. Fournet and G. Gonthier. The reflexive chemical abstract machine and the join calculus. In Proc. POPL'96, pp. 372-385, 1996.
11. R. Grosu and K. Stolen. A model for mobile point-to-point data-flow networks without channel sharing. In Proc. AMAST'96, LNCS, 1996.
12. G.J. Holzmann. The model checker SPIN IEEE Transactions on Software Engineering 23:5, 1997.
13. G. Kahn. The semantics of a simple language for parallel programming. In IFIP74 Congress, North Holland, Amsterdam, 1974.
14. He Jifeng, M.B. Josephs, and C.A.R. Hoare. A theory of synchrony and asynchrony. In Proc. IFIP Conf. on Programming Concepts and Methods, 1990.
15. B. Jonsson. A fully abstract trace model for dataflow and asynchronous networks. Distributed Computing, 7:197-212, 1994.
16. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, parts I and II. Information and Computation 100(1):1-77, 1992.
17. E.-R. Olderog and C.A.R. Hoare. Specification-oriented semantics for communicating processes. Acta Informatica 23:9-66, 1986.