Abstract
We consider dynamic Kahn-like dataflow networks defined by a simple language L containing the fork-statement. The first part of the Kahn principle states that such networks are deterministic on the I/O level: for each network, different executions provided with the same input deliver the same output. The second part of the principle states that the function from input streams to output streams (which is now defined because of the first part) can be obtained as a fixed point of a suitable operator derived from the network specification. The first part has been proven by us in [BN96, BN97]. To prove the second part, we will use the metric framework. We introduce a nondeterministic transition system NT from which we derive an operational semantics On. We also define a deterministic transition system DT and prove that the operational semantics O d derived from DT is the same as O n. Finally, we define a denotational semantics D and prove D = O d. This implies O n = D. Thus the second part of the Kahn principle is established.
Preview
Unable to display preview. Download preview PDF.
References
A. Arnold, Sémantique des processus communicants, RAIRO Theor.Inf. 15,2, pp.103–139, 1981.
J. W. de Bakker, F. van Brengel and A. de Bruin, Comparative semantics for linear arrays of communicating processes, a study of the UNIX fork and pipe commands, in: A.M. Borzyszkowski and S. Sokolowski (eds.) Proc. Math. Foundations of Computer Science, LNCS 711, pp.252–261 Springer, 1993.
J. W. de Bakker, E. de Vink, Control Flow Semantics, MIT press, 1996.
A. de Bruin, S. H. Nienhuys-Cheng, Linear dynamic Kahn networks are deterministic, in: W. Penczek, A. Szalas (Eds.), Proc. Math. Foundations of Computer Science, LNCS 1113, pp.242–254, Springer, 1996.
A. de Bruin, S. H. Nienhuys-Cheng, Linear dynamic Kahn networks are deterministic, complete version of [BN96]. Accepted by Theoretical Computer Science, 1997, special issue for MFCS96. It is based on a technical report, Erasmus University Rotterdam. (http://kaa.cs.few.eur.nl/few/inf/publicaties/rapporten/eur-few-cs-94-06.html).
J.M. Cadiou, Recursive definitions of partial functions and their computations, Ph.D. thesis, Stanford Univ., 1972.
G. Kahn, The semantics of a simple language for parallel programming, in: Proc. IFIP74, J.L. Rosenfeld (ed.), North-Holland, pp.471–275, 1974.
N. Lynch and E. Stark, A proof of the Kahn principle for input/output automata, Information and Computation, 82, 1, pp.81–92, 1989.
S. H. Nienhuys-Cheng and A. de Bruin. Kahn's fixed-point characterization for linear dynamic networks. Technical report, Erasmus University Rotterdam. (http://kaa.cs.few.eur.nl/few/inf/publicaties/rapporten/eur-few-cs-97-06.html).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nienhuys-Cheng, SH., de Bruin, A. (1997). Kahn's fixed-point characterization for linear dynamic networks. In: Plášil, F., Jeffery, K.G. (eds) SOFSEM'97: Theory and Practice of Informatics. SOFSEM 1997. Lecture Notes in Computer Science, vol 1338. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63774-5_133
Download citation
DOI: https://doi.org/10.1007/3-540-63774-5_133
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63774-5
Online ISBN: 978-3-540-69645-2
eBook Packages: Springer Book Archive