A relational model of non-deterministic dataflow

Mathematical Structures in Computer Science

Volumn 14, Issue 5, 2004, Pages 613-649

  Hildebrandt, Thomas T ^a   Panangaden, Prakash ^a   Winskel, Glynn ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 14544281092     PISSN: 09601295     EISSN: 14698072     Source Type: Journal    
DOI: 10.1017/S0960129504004293     Document Type: Article

References (55)

1. Abramsky, S. (1990) A generalized Kahn principle for abstract asynchronous networks. In: MFPS’89. Springer-Verlag Lecture Notes in Computer Science 442 1–21.
2. Abramsky, S. (1996) Retracing some paths in process algebra. In: CONCUR’96. Springer-Verlag Lecture Notes in Computer Science 1119 1–17.
3. Abramsky, S., Gay, S. and Nagarajan, R. (1994) Interaction categories and the foundations of typed concurrent programming. In: Proc. of the 1994 Marktoberdorf summer school, Springer.
4. Bainbridge, E. S. (1976) Feedback and generalized logic. Information and Control 31 75–96.
5. Berry, G. (1979) Modeles completement adequats et stable des lambda-calculus types, Ph.D. thesis, L’universite Paris VII.
6. Borceux, F. (1994) Handbook of categorical logic, volume 1, Cambridge University Press.
7. Brock, J. and Ackerman, W. (1981) Scenarios: A model of non-determinate computation. In: Diaz, J. and Ramos, I. (eds.) Formalization of Programming Concepts. Springer-Verlag Lecture Notes in Computer Science 107.
8. Brock, J. D. (1983) A Formal Model of Non-determinate Dataflow Computation, Ph.D. thesis, Laboratory for Computer Science, MIT. Cattani, G. L. (1999) Presheaf Presheaf Presheaf models for concurrency, Ph.D. thesis, Aarhus University.
9. Cattani, G. L. and Winskel, G. (1997) Presheaf models for concurrency. In: Computer Science Logic: Tenth international Workshop, CSL’96, Annual Conference of the EACSL. Selected Papers. Springer-Verlag Lecture Notes in Computer Sciente 1258 58–75.
10. Cattani, G. L. and Winskel, G. (1999) Presheaf models for CCS-like languages. Technical report, BRICS, RS-99-14.
11. Cattani, G. L. and Winskel, G. (2000) Profunctors, open maps and bisimulation (manuscript).
12. Day, B. J. and Street, R. (1997) Monoidal bicategories and hopf algebroids. Advances in Mathematics 129 99–157.
13. Dennis, J. B. (1974) First version of a dataflow procedure language. In: Robinet, B. (ed.) Proceedings Colloque sur la Programmation. Springer-Verlag Lecture Notes in Computer Science 19 362–376.
14. Diekert, Y. and Metivier, Y. (1997) Partial Commutation and Traces. Chapter in Handbook of Formal Languages, Springer.
15. Faustini, A. A. (1982) An operational semantics for pure dataflow. In: ICALP’82. Springer-Verlag Lecture Notes in Computer Science 140 212–224.
16. Gay, S. J. (1995) Linear Types for Communicating Processes, Ph.D. thesis, University of London, Imperial College of Science, Technology and Medicine, Department of Computing.
17. Girard, J.-Y. (1989a) Geometry of interaction I: interpretation of system F. In: Bonotto, C., Ferro, R., Yalentini, S. and Zanardo, A. (eds.) Proceedings Logic Colloquium 88 221–260.
18. Girard, J.-Y. (1989b) Geometry of interaction II: deadlock free algorithms. In: Martin-Lof, P. and Mints, G. (eds.) Proceedings of COLOG 88. Springer-Verlag Lecture Notes in Computer Science 417 76–93.
19. Gunter, C. A. (1992) Semantics of Programming Languages, MIT Press.
20. Hasegawa, M. (1997a) Models of Sharing Graphs: A Categorical Semantics of let and letrec, Ph.D. thesis, Department of Computer Science, The University of Edinburgh.
21. Hasegawa, M. (1997b) Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In: Proceedings of TLCA’97. Springer-Verlag Lecture Notes in Computer Science 1210 196–213.
22. Hasegawa, M. (2003) The uniformity principle on traced monoidal categories. In: Proceedings of CTCS’02. Electronic Notes in Theoretical Computer Science 69.
23. Hildebrandt, T. T. (1999a) Categorical Models for Concurrency: Independence, Fairness and Dataflow, Ph.D. thesis, Department of Computer Scence, University of Aarhus, Denmark.
24. Hildebrandt, T. T. (1999b) A fully abstract presheaf semantics of SCCS with finite delay. Research Series RS-99-28, BRICS, Department of Computer Science, University of Aarhus. (Appears in Proceedings of CTCS’99. Electronic Notes in Theoretical Computer Science 29.)
25. Hildebrandt, T. T. (2000) A generalized Kahn principle for a relational semantics of indeterminate dataflow. Extended abstract presented at MFPS XVI.
26. Hyland, M. (1995) Category theory, Handwritten lecture notes taken by C. Hillhorst.
27. Jones, V. F. (1985) A polynomial invariant for links via von neumann algebras. Bull Amer. Math. Soc. 129 103–112.
28. Jonsson, B. (1989) A fully abstract trace model for dataflow networks. In: POPE89, ACM 155–165.
29. Joyal, A. and Moerdijk, I. (1994) A completeness theorem for open maps. Annals of Pure and Applied Logic 70(1)51-86.
30. Joyal, A., Nielsen, M. and Winskel, G. (1996a) Bisimulation from open maps. LICS ’93. Information and Computation 127 (2) 164–185. (Available as BRICS report, RS-94-7.)
31. Joyal, A., Street, R. and Verity D. (1996b) Traced monoidal categories. Math. Proc. Camb. Phil. Soc. 119 447–468.
32. Kahn, G. (1974) The semantics of a simple language for parallel programming. Information Processing 74 471–475. Kahn, G. and MacQueen, D. (1977) Coroutines and networks of parallel processes. In: Gilchrist, B. (ed.) Proceedings of Information Processing, North-Holland 993–998.
33. Katis, P., Sabadini, N. and Walters, R. (1997) Bicategories of processes. Journal of Pure and Applied Algebra.
34. Kok, J. (1987) A fully abstract semantics for dataflow nets. In: Proceedings of Parallel Architectures And Languages Europe, Springer 351–368.
35. Lynch, N. and Tuttle, M. (1987) Hierarchical correctness proofs for distributed algorithms. Technical report, M.I.T. Laboratory for Computer Science.
36. Lynch, N. A. and Stark, E. W. (1989) A proof of the Kahn principle for input/output automata. Information and Computation 82 81–92.
37. Mac Lane, S. (1971) Categories for the Working Mathematician, Springer.
38. Mac Lane, S. and Moerdijk, I. (1992) Sheaves in Geometry and Logic: A First Introduction to Topos Theory, Springer.
39. Panangaden, P. (1995) The expressive power of indeterminate primitives in asynchronous computations. Technical Report SOCS-95.8, School of Computer Science, McGill.
40. Panangaden, P. and Shanbhogue, V. (1992) The expressive power of indeterminate dataflow primitives. Information and Computation 98 (1) 99–131.
41. Panangaden, P. and Stark, E. W. (1988) Computations, residuals and the power of indeterminacy. In: Proc. of the 15th ICALP, Springer 439–454.
42. Rabinovich, A. and Trakhtenbrot, B. A. (1988) Nets of processes and dataflow. In: Proceedings of ReX School on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency. Springer-Verlag Lecture Notes in Computer Science 354 574–602.
43. Rabinovich, A. and Trakhtenbrot, B. A. (1989) Nets and data flow interpreters. In: Proceedings of the 4th LICS, 164–174.
44. Rabinovich, A. and Trakhtenbrot, B. A. (1990) Communication among relations. In: Paterson, M. S. (ed.) Proc. of the 7th ICALP. Springer-Verlag Lecture Notes in Computer Science 443 294–307.
45. Selinger, P. (1997) First-order axioms for asynchrony. In: Mazurkiewicz, A. and Winkowski, J. (eds.) CONCUR’97. Springer-Verlag Lecture Notes in Computer Science 1243 376–390.
46. Selinger, P. (1999) Categorical structure of asynchrony. Electronic Notes in Theoretical Computer Science 20.
47. Staples, J. and Nguyen, V. L. (1985) A fixpoint semantics for nondeterministic data flow. Journal of the ACM 32 (2)411-444.
48. Stark, E. (1998) Fibrational semantics of dataflow networks. In: Proceedings of CONCUR ’98. Springer-Verlag Lecture Notes in Computer Science.
49. Stark, E. W. (1989a) Compositional relational semantics for indeterminate dataflow networks. In: CTCS, Manchester, United Kingdom. Springer-Verlag Lecture Notes in Computer Science 389 52–74.
50. Stark, E. W. (1989b) Dataflow networks are fibrations. Technical report, Dept, of Computer Science, Stony Brook.
51. Stark, E. W. (1992) A calculus of dataflow networks. In: LICS ’92, Proceedings of the 7th Annual Symposium on Logic in Computer Science, IEEE Computer Society Press 125–136.
52. Street, R. (1980) Fibrations in bicategories. Cahiers de topologie et gomtrie diffrentielle XXI(2 - 2etrimestre) 111–160.
53. Street, R. (2003) Functorial calculus in monoidal bicategories. Applied Categorical Structures (to appear).
54. Winskel, G. and Nielsen, M. (1995) Models for concurrency. Chapter in Handbook of Logic in Computer Science, OUP volume IV 1–148.
55. Winskel, G. and Nielsen, M. (1996) Presheaves as transition systems. In: Peled, D., Pratt, V. and Holzmann, G. (eds.) POMIV’96. DIMACS, AMS 29 129–140.