A relational model of non-deterministic dataflow

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

Volumn 1466, Issue , 1998, Pages 613-628

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

^a AARHUS UNIVERSITY   (Denmark)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

SEMANTICS;

BISIMULATIONS; GENERALISATION; GEOMETRY OF INTERACTION PROGRAMME; HIGHER-ORDER; MONOIDAL CATEGORIES; PROFUNCTORS; RELATIONAL MODEL; RELATIONAL SEMANTICS;

DATA FLOW ANALYSIS;

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

References (37)

1. S. Abramsky. A generalized kahn principle for abstract asynchronous networks. In MFPS’89, volume 442 of LNCS, pages 1-21. Springer, 1990.
2. S. Abramsky. Retracing some paths in process algebra. In U. Montanari and V. Sassone, editors, CONCUR’96, volume 1119 of LNCS, pages 1-17. Springer, August 1996.
3. S. Abramsky, S. Gay, and R. Nagarajan. Interaction categories and the foundations of typed concurrent programming. In Proc. of the 1994 Marktoberdorf summer school. Springer, 1994.
4. E. S. Bainbridge. Feedback and generalized logic. Information and Control, (31): 75-96, 1976.
5. F. Borceux. Handbook of categorical logic, volume 1. Cambridge University Press, 1994.
6. J. Brock and W. Ackerman. Scenarios: A model of non-determinate computation. In J. Diaz and I. Ramos, editors, Formalization of Programming Concepts, volume 107 of LNCS. Springer, 1981.
7. G. L. Cattani and G. Winskel. Presheaf models for concurrency. In CSL’96, volume 1258 of LNCS, pages 58-75. Springer, 1997.
8. A. Cheng. Petri nets, traces, and local model checking. Research Series RS-95-39, BRICS, Department of Computer Science, University of Aarhus, July 1995.
9. J. B. Dennis. First version of a dataflow procedure language. In B. Robinet, editor, Proceedings Colloque sur la Programmation, volume 19 of LNCS, pages 362-376. Springer, 1974.
10. V. Diekert and Y. Métivier. Handbook of Formal Languages., volume 3, chapter Partial Commutation and Traces. Springer, 1997.
11. A. A. Faustini. An operational semantics for pure dataflow. In ICALP’82, volume 140 of LNCS, pages 212-224. Springer, 1982.
12. M. Gordon. The semantic challenge of verilog hdl. www.cl.cam.ac.uk/mjcg/, April 1996. Revised version of an invited paper published in LICS’95.
13. M. Hasegawa. Recursion from cyclic sharing: traced monoidal categories and models of cyclic lambda calculi. In TLCA’97, volume 1210 of LNCS, pages 196-213, April 1997.
14. V. F. Jones. A polynomial invariant for links via von neumann algebras. Bull. Amer. Math. Soc, 129: 103-112, 1985.
15. B. Jonsson. A fully abstract trace model for dataflow networks. In POPL’89, pages 155165. ACM, 1989.
16. A. Joyal and I. Moerdijk. A completeness theorem for open maps. Annals of Pure and Applied Logic, 70(1): 51-86, 1994.
17. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Research Series RS-94-7, BRICS, Department of Computer Science, University of Aarhus, May 1994. 42 pp. Appears in LICS '93 special issue of Information and Computation, 127(2): 164-185.
18. A. Joyal, R. Street, and D. Verity. Traced monoidal categories, volume 119 of Math. Proc. Camb. Phil. Soc, pages 447-468, 1996.
19. G. Kahn. The semantics of a simple language for parallel programming. In Information Processing, volume 74, pages 471-475, 1974.
20. G. Kahn and D. MacQueen. Coroutines and networks of parallel processes. In Gilchrist, editor, Proceedings of Information Processing, pages 993-998. North-Holland, 1977.
21. R Katis, N. Sabadini, and R. Walters. Bicategories of processes. Journal of Pure and Applied Algebra, (115): 141-178, 1997.
22. J. Kok. A fully abstract semantics for dataflow nets. In Proceedings of Parallel Architectures And Languages Europe, pages 351-368, Berlin, 1987. Springer.
23. N. A. Lynch and E. W. Stark. A proof of the kahn principle for input/output automata. Information and Computation, 82: 81-92, 1989.
24. S. Mac Lane and I. Moerdijk. Sheaves in Geometry and Logic: A First Introduction to Topos Theory. Springer, 1992.
25. S. Mac Lane. Categories for the Working Mathematician. Graduate Texts in Mathematics. Springer, 1971.
26. P. Panangaden and V. Shanbhogue. The expressive power of indeterminate dataflow primitive. Information and Computation, 98(1): 99-131, 1992.
27. P. Panangaden and E. W. Stark. Computations, residuals and the power of indeterminacy. In Proc. of the 15th ICALP, pages 439-454. Springer, 1988.
28. V. Pratt. Modelling concurrency with partial orders. International Journal of Parallel Programming, (1), 1986.
29. A. Rabinovich and B. A. Trakhtenbrot. Nets and data flow interpreters. In Proceedings of the 4th LICS, pages 164-174, 1989.
30. A. Rabinovich and B. A. Trakhtenbrot. Nets of processes and dataflow, volume 354 of LNCS, 1989. To appear in Proceedings of ReX School on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, LNCS.
31. A. Rabinovich and B. A. Trakhtenbrot. Communication among relations. In M. S. Paterson, editor, Proc. of the 7th ICALP, volume 443 of LNCS, pages 294-307. Springer, 1990.
32. P. Selinger. First-order axioms for asynchrony. In A. Mazurkiewicz and J. Winkowski, editors, CONCUR’97, volume 1243 of LNCS, pages 376-390. Springer, 1997.
33. E. W. Stark. Compositional relational semantics for indeterminate dataflow networks. In CTCS, volume 389 of LNCS, pages 52-74, Manchester, U.K., 1989. Springer.
34. E. W. Stark. Dataflow networks are fibrations. In CTCS, volume 530 of LNCS, pages 261-281. Springer, September 1991.
35. E. W. Stark. A calculus of dataflow networks. In Proceedings of the 7th LICS, pages 125-136, June 1992.
36. G. Winskel and M. Nielsen. Handbook of Logic in Computer Science, volume IV, chapter Models for concurrency. OUP, 1995.
37. G. Winskel and M. Nielsen. Presheaves as transition systems. In D. Peled, V. Pratt, and G. Holzmann, editors, POMIV’96, volume 29 of DIMACS. AMS, july 1996.