Abstract
A technology of designing dataflow programs is proposed. It is based on the principle of structuring programs and allows to fulfil the check-up of their correctness.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rabinovich A., Trakhtenbrot B.A.: Nets of processes and data flow. Lecture Notes in Computer Science. 354 (1988) 574–602
Broy M.: Semantics of Finite and Infinite Networks of Concurrent Commumicating Agents. Distributed Computing. 2 (1987) 13–31
Rabinovich A., Trakhtenbrot B.A.: On Nets, Algebras and Modularity. Lecture Notes in Computer Science, 526 (1991) 176–203
Dennis J.B.: Machines and Models for parallel Computing. International Jourmal of Parallel Programming, 22 N 1 (1994) 47–77.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sokolov, V.A., Roubtsova, E.E., Roubtsov, S.A. (1997). On a technology of design and analysis of dataflow programs. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1997. Lecture Notes in Computer Science, vol 1277. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63371-5_13
Download citation
DOI: https://doi.org/10.1007/3-540-63371-5_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63371-6
Online ISBN: 978-3-540-69525-7
eBook Packages: Springer Book Archive