Abstract
This paper introduces a systematic approach to the modeling of computational processes in terms of
-
the control discipline which drives a computation step by step ahead;
-
the operational discipline which, in an orderly manner, supplies operators with operands.
Starting with a simple PrT net primitive representing the application of a function to one or more arguments, we systematically derive reduction, data flow and control flow as basic models of computations and elaborate on their conceptual differences. Particular emphasis is placed on the implications as regards non-sequential processing.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Arvind, W. Plouffe: ‘The ID-Report: An Asyncronous Programming Language and Computing Machine'; Univ. Cal. Irvine Tech. Rep. 114, 1978
J. Backus: ‘Can Programming be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs'; Comm. Ass. Comp. Mach. Vol. 21, pp. 613–641, Aug. 1978
K. J. Berkling: ‘Reduction Languages for Reduction Machines'; Proc. 2nd Ann. Symp. Comp. Arch. Jan. 20–22, 1975 ACM-IEEE 75CH0916-7C, pp. 133–140
A. Church: ‘The Calculi of Lambda-conversion'; Annals Math. Studies; Princeton, N.I.; Princeton Univ. Press, 1941
J. B. Dennis, D. P. Misunas: ‘A Preliminary Architecture for Basic Data Flow Processors'; Proc. 2nd Ann. Symp. Comp. Arch. Jan. 20–22, ACM/IEEE 75CH0916-7C, pp. 126–132
H. J. Genrich, K. Lautenbach: ‘System Modelling with High-Level Petri-Nets'; Theor. Comp. Sci. Vol. 13, pp. 109–136, 1981
H. J. Genrich, K. Lautenbach, P. S. Thiagarajan: ‘Elements of General Net Theory: Predicate-Transition Nets'; Net Theory and Applications, Lecture Notes in Computer Science, No. 84, Berlin, W. Germany; Springer-Verlag, pp. 76–92, 1980
H. J. Genrich, E. Stankiewicz-Wiechno: ‘A Dictionary of some Basic Notions of Net Theory'; Net Theory and Applications, Lecture Notes in Computer Science, No. 84, Berlin, W. Germany; Springer-Verlag, pp. 519–539, 1980
W. E. Kluge, H. Schlütter: ‘Petri-Net Models for the Evaluation of Applicative Programs Based on λ-Expressions'; IEEE-TSE, Vol. SE-9, No. 4, pp. 415–427, 1983
W. E. Kluge: ‘An Approach to Computer System Modeling Based on Petri-Nets'; in: ‘Methodologics for Computer System Design', W.K. Giloi and B.D. Shriver (Ed.), North-Holland 1985, pp. 143–159
E. Meijer: ‘Petri-Net Models for the λ-Calculus'; Proc. of the Seventh European Workshop on Application and Theory of Petri Nets, Oxford, England, June 30th–July 2nd, 1986, pp. 285–310
C. A. Petri: ‘Concepts of Net Theory'; Math. Found. of Comp. Sci., Math. Inst. of Slovak Academy of Science, 1973
P. C. Treleaven, D. R. Brownbridge, R. P. Hopkins: ‘Data Driven and Demand Driven Computer Architecture'; ACM Comp. Surveys, Vol. 14, No. 1, pp. 93–143, 1982
D. A. Turner: ‘A New Implementation Technique for Applicative Languages'; Software-Practice and Experience, Vol. 9, pp. 31–49, 1979
P. Wegner: ‘Programming Languages, Information Structures and Machine Organization'; New York: McCraw Hill, 1968
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kluge, W. (1987). Reduction, data flow and control flow models of computation. In: Brauer, W., Reisig, W., Rozenberg, G. (eds) Petri Nets: Applications and Relationships to Other Models of Concurrency. ACPN 1986. Lecture Notes in Computer Science, vol 255. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17906-2_35
Download citation
DOI: https://doi.org/10.1007/3-540-17906-2_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17906-1
Online ISBN: 978-3-540-47926-0
eBook Packages: Springer Book Archive