Abstract
Given suitable categories T, C and functor F : T → C, if X,Y are objects of T, then we define an (X,Y)-relation in C to be a triple \(\left( {R,\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{r} ,\bar r} \right)\), where R is an object of C and r : R → FX and \(\bar r:R \to FY\)are morphisms of C. We define an algebra of relations in C, including operations of “relabeling,” “sequential composition,” “parallel composition,” and “feedback,” which correspond intuitively to ways in which processes can be composed into networks. Each of these operations is defined in terms of composition and limits in C, and we observe that any operations defined in this way are preserved under the mapping from relations in C to relations in C′ induced by a continuous functor G : C → C′.
To apply the theory, we defined a category Auto of concurrent automata, and we give an operational semantics of dataflow-like networks of processes with indeterminate behaviors, in which a network is modeled as a relation in Auto. We then define a category EvDom of “event domains,” a (non-full) subcategory of the category of Scott domains and continuous maps, and we obtain a coreflection between Auto and EvDom. It follows, by the limit-preserving properties of coreflectors, that the denotational semantics in which dataflow networks are represented by relations in EvDom, is “compositional” in the sense that the mapping from operational to denotational semantics preserves the operations on relations. Our results are in contrast to examples of Brock and Ackerman, which imply that no compositional semantics is possible in terms of set-theoretic relations.
Research supported in part by NSF Grant CCR-8702247.
Preview
Unable to display preview. Download preview PDF.
References
I. J. Aalbersberg and G. Rozenberg. Theory of traces. Theoretical Computer Science, 60(1):1–82, 1988.
M. Bednarczyk. Categories of Asynchronous Systems. PhD thesis, University of Sussex, October 1987.
J. D. Brock. A Formal Model of Non-Determinate Dataflow Computation. PhD thesis, Massachusetts Institute of Technology, 1983. Available as MIT/LCS/TR-309.
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.
M. Broy. Nondeterministic data-flow programs: how to avoid the merge anomaly. Science of Computer Programming, 10:65–85, 1988.
P.-L. Curien. Categorical Combinators, Sequential Algorithms, and Functional Programming. Research Notes in Theoretical Computer Science, Pitman, London, 1986.
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.
H. Herrlich and G. E. Strecker. Category Theory. Sigma Series in Pure Mathematics, Heldermann Verlag, 1979.
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.
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.
S. Mac Lane. Categories for the Working Mathematician. Volume 5 of Graduate Texts in Mathematics, Springer Verlag, 1971.
A. Mazurkiewicz. Trace theory. In Advanced Course on Petri Nets, GMD, Bad Honnef, September 1986.
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.
G. D. Plotkin. Domains: lecture notes. 1979. (unpublished manuscript).
D. A. Schmidt. Denotational Semantics: A Methodology for Language Development. Allyn and Bacon, 1986.
E. W. Stark. Concurrent transition system semantics of process networks. In Fourteenth ACM Symposium on Principles of Programming Languages, pages 199–210, January 1987.
E. W. Stark. Concurrent transition systems. Theoretical Computer Science, 1989. (to appear).
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).
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.
G. Winskel. Events in Computation. PhD thesis, University of Edinburgh, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stark, E.W. (1989). Compositional relational semantics for indeterminate dataflow networks. In: Pitt, D.H., Rydeheard, D.E., Dybjer, P., Pitts, A.M., Poigné, A. (eds) Category Theory and Computer Science. Lecture Notes in Computer Science, vol 389. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0018344
Download citation
DOI: https://doi.org/10.1007/BFb0018344
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51662-0
Online ISBN: 978-3-540-46740-3
eBook Packages: Springer Book Archive