Abstract
Dataflow networks are a paradigm for concurrent computation in which a collection of concurrently and asynchronously executing processes communicate by sending messages over FIFO message channels. In a previous paper, we showed that dataflow networks could be represented as certain spans in a category of automata, or more abstractly, in a category of domains, and we identified some universal properties of various operations for building networks from components. Not all spans corresponded to dataflow processes, and we raised the question of what might be an appropriate categorical characterization of those spans that are “dataflow-like.” In this paper, we answer this question by obtaining a characterization of the dataflow-like spans as split right fibrations, either in a 2-category of automata or a 2-category of domains. This characterization makes use of the theory of fibrations in a 2-category developed by Street. In that theory, the split right fibrations are the algebras of a certain doctrine (or 2-monad) R on a category of spans. For the 2-categories we consider, R has a simple interpretation as an “input buffering” construction.
Research supported in part by NSF Grant CCR-8902215.
Preview
Unable to display preview. Download preview PDF.
References
A. Carboni and R. F. C. Walters. Cartesian bicategories I. Journal of Pure and Applied Algebra, 49:11–32, 1987.
J. W. Gray. Fibred and cofibred categories. In Proc. Conference on Categorical Algebra at La Jolla, pages 21–83, Springer-Verlag, 1966.
A. Grothendieck. Catégories fibrées et descente. In Séminaire de Géométrie Algébrique de l'Institute des Hautes Études Scientifiques, Paris 1960/61 (SGA 1), pages 145–194, Springer-Verlag, 1971.
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.
G. M. Kelly and R. H. Street. Review of the elements of 2-categories. In Lecture Notes in Mathematics 420, pages 75–103, Springer-Verlag, 1974.
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 T. Lepisto and A. Salomaa, editors, Automata, Languages, and Programming, pages 439–454, Springer-Verlag. Volume 317 of Lecture Notes in Computer Science, 1988.
E. W. Stark. Compositional relational semantics for indeterminate dataflow networks. In Category Theory and Computer Science, pages 52–74, Springer-Verlag. Volume 389 of Lecture Notes in Computer Science, Manchester, U. K., 1989.
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, 64:221–269, 1989.
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, 1990. (to appear).
E. W. Stark. A simple generalization of Kahn's principle to indeterminate dataflow networks. In M. Z. Kwiatkowska, M. W. Shields, and R. M. Thomas, editors, Semantics for Concurrency, Leicester 1990, pages 157–176, Springer-Verlag, 1990.
R. H. Street. Fibrations and Yoneda's lemma in a 2-category. In Lecture Notes in Mathematics 420, pages 104–133, Springer-Verlag, 1974.
R. H. Street. Fibrations in bicategories. Cahier de Topologie et Géometrie Différentielle, XXI-2:111–159, 1980.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stark, E.W. (1991). Dataflow networks are fibrations. In: Pitt, D.H., Curien, PL., Abramsky, S., Pitts, A.M., Poigné, A., Rydeheard, D.E. (eds) Category Theory and Computer Science. CTCS 1991. Lecture Notes in Computer Science, vol 530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013470
Download citation
DOI: https://doi.org/10.1007/BFb0013470
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54495-1
Online ISBN: 978-3-540-38413-7
eBook Packages: Springer Book Archive