Compositional relational semantics for indeterminate dataflow networks

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

Volumn 389 LNCS, Issue , 1989, Pages 52-74

  Stark, Eugene W ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; CONFORMAL MAPPING; MAPPING; SEMANTIC WEB; SEMANTICS;

COMPOSITIONAL SEMANTICS; CONCURRENT AUTOMATA; DENOTATIONAL SEMANTICS; NETWORKS OF PROCESS; OPERATIONAL SEMANTICS; PARALLEL COMPOSITION; RELATIONAL SEMANTICS; SEQUENTIAL COMPOSITIONS;

C (PROGRAMMING LANGUAGE);

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

References (20)

1. I. J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60(1):1-82, 1988.
2. M. Bednarczyk. Categories of Asynchronous Systems. PhD thesis, University of Sussex, October 1987.
3. J. D. Brock. A Formal Model of Non-Determinate Dataflow Computation. PhD thesis, Massachusetts Institute of Technology, 1983. Available as MIT/LCS/TR-309.
4. J. D. Brock and W. B. Ackerman. Scenarios: a model of non-determinate computation. In Formalization of Programming Concepts, pages 252-259, Springer-Verlag. Volume 107 of Lecture Notes in Computer Science, 1981.
5. M. Broy. Nondeterministic data-flow programs: how to avoid the merge anomaly. Science of Computer Programming, 10:65-85, 1988.
6. P.-L. Curien. Categorical Combinators, Sequential Algorithms, and Functional Programming. Research Notes in Theoretical Computer Science, Pitman, London, 1986.
7. A. A. Faustini. An operational semantics for pure dataflow. In Automata, Languages, and Programming, 9th Colloquium, pages 212-224, Springer-Verlag. Volume 140 of Lecture Notes in Computer Science, 1982.
8. H. Herrlich and G. E. Strecker. Category Theory. Sigma Series in Pure Mathematics, Heldermann Verlag, 1979.
9. G. Kahn. The semantics of a simple language for parallel programming. In J. L. Rosenfeld, editor, Information Processing 74, pages 471-475, North-Holland, 1974.
10. G. Kahn and D. B. MacQueen. Coroutines and networks of parallel processes. In B. Gilchrist, editor, Information Processing 77, pages 993-998, North-Holland, 1977.
11. S. Mac Lane. Categories for the Working Mathematician. Volume 5 of Graduate Texts in Mathematics, Springer Verlag, 1971.
12. A. Mazurkiewicz. Trace theory. In Advanced Course on Petri Nets, GMD, Bad Honnef, September 1986.
13. P. Panangaden and E. W. Stark. Computations, residuals, and the power of indeterminacy. In Automata, Languages, and Programming, pages 439-454, Springer-Verlag. Volume 317 of Lecture Notes in Computer Science, 1988.
14. G. D. Plotkin. Domains: lecture notes. 1979. (unpublished manuscript).
15. D. A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, 1986.
16. E. W. Stark. Concurrent transition system semantics of process networks. In Fourteenth ACM Symposium on Principles of Programming Languages, pages 199-210, January 1987.
17. E. W. Stark. Concurrent transition systems. Theoretical Computer Science, 1989. (to appear).
18. E. W. Stark. Connections between a concrete and abstract model of concurrent systems. In Fifth Conference on the Mathematical Foundations of Programming Semantics, Springer-Verlag. Lecture Notes in Computer Science, New Orleans, LA, 1989 (to appear).
19. E. W. Stark. On the Relations Computed by a Class of Concurrent Automata. Technical Report 88-09, SUNY at Stony Brook Computer Science Dept., 1988.
20. G. Winskel. Events in Computation. PhD thesis, University of Edinburgh, 1980.