Abstract
We present a denotational model of nondeterministic dataflow in which an explicit notion of causality is introduced. We define a set of labelled flows over a set of fixed channels and two orders which induce cpo structures. Labelled flows are based on a conflict relation which allows to express several behaviours (configurations) at once. A netflow is a continuous function over configurations used to represent a dataflow network. We use a form of Galois connection in which such a function is the upper adjoint to correlate the possible outputs with their causes. The feedback operation is defined using a fixed point construction. Russell’s example is used to show how this formal approach solves causal anomalies of nondeterministic dataflow.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Abramsky, S.: A Generalized Kahn Principle for Abstract Asynchronous Networks. In: Schmidt, D.A., Main, M.G., Melton, A.C., Mislove, M.W. (eds.) MFPS 1989. LNCS, vol. 442, pp. 1–21. Springer, Heidelberg (1990)
Abramsky, S., Jung, A.: Domain Theory. In: Handbook of Logic in Computer Science, vol. III, pp. 1–168. Clarendon Press (1994)
Brock, J., Ackerman, W.: Formalization of Programming Concepts. LNCS, vol. 107, pp. 252–259. Springer, Heidelberg (1981)
Erné, M., Koslowski, J., Melton, A., Strecker, G.E.: A Primer on Galois Connections. In: Paulisch, F.N. (ed.) The Design of an Extendible Graph Editor. LNCS, vol. 704, pp. 103–125. Springer, Heidelberg (1993)
Hildebrandt, T.T., Panangaden, P., Winskel, G.: A Relational Model of Non-Deterministic Dataflow. Mathematical Structures in Computer Science 14, 613–649 (2004)
Gaifman, H., Pratt, V.R.: Partial Order Models of Concurrency and the Computation of Functions. Logic in Computer Science, 72–85 (1987)
Jonsson, B.: A Fully Abstract Trace Model for Dataflow Networks. Principles of Programming Languages, 155–165 (1989)
Kahn, G.: The Semantics of a Simple Language for Parallel Programming. In: IFIP Congress, pp. 471–475 (1974)
Najjar, W.A., Lee, E.A., Gao, G.R.: Advances in the Dataflow Computational Model. Parallel Computing 25, 1907–1929 (1999)
Nielson, M., Plotkin, G.D., Winskel, G.: Petri Nets, Event Structures and Domains. Rechnerstrukturen und Betriebsprogrammierung 13, 85–108 (1981)
Russell, J.R.: Full Abstraction for Nondeterministic Dataflow Networks. Foundations of Computer Science, 170–175 (1989)
Saunders-Evans, L., Winskel, G.: Event Structure Spans for Nondeterministic Dataflow. Electronic Notes of Theoretical Computer Science 175, 109–129 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrigoroaiei, O., Ciobanu, G. (2008). Non-interleaving Semantics with Causality for Nondeterministic Dataflow. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds) Theoretical Aspects of Computing - ICTAC 2008. ICTAC 2008. Lecture Notes in Computer Science, vol 5160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85762-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-85762-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85761-7
Online ISBN: 978-3-540-85762-4
eBook Packages: Computer ScienceComputer Science (R0)