Skip to main content
SpringerLink
Log in

On the power of recursion in dataflow Schemes

  • Conference paper
  • First Online:
Perspectives of System Informatics (PSI 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1181))

  • 147 Accesses

Abstract

Dataflow Schemes are formalizations of dataflow languages. We consider a class of schemes where the meaning of a node can be defined by a scheme, i.e. recursion is allowed. Data streams may flow through such a scheme in accordance with the dataflow relation defined in the scheme. Well-formed schemes allow only a downward dataflow unless iterations which include only one node. It is shown that every scheme can be transformed in a well-formed one. The main result concerns the power of iteration. It turns out that, on the basis of a certain class of stream functions, more functions can be implemented by recursion than without using iteration.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ackerman,W.B.: Data Flow Languages. Computer 15,2, 1982.

    Google Scholar 

  2. Ashcroft,E.A.: Dataflow and Education: Data-driven and Demand-driven Distributed Computation. LNCS 224, 1–50, Springer, Berlin, 1986.

    Google Scholar 

  3. Dennis,J.B.: First version of a Data Flow Procedure Language. LNCS 19, 362–376, Springer, Berlin, 1974.

    Google Scholar 

  4. Dennis,J.B., Fosseen, J.B., Linderman, J.P.: Data Flow Schemes. LNCS 19, Springer, Berlin, 1974.

    Google Scholar 

  5. Ershov,A.P., Ljapunov, A.A.: On the formalisation of the program notion. Kibernetika, Kiev, 1967.

    Google Scholar 

  6. Ershov,A.P.: Theory of program schemata. IFIP Congress 1971, North Holland Publishing Company, Amsterdam, 1971.

    Google Scholar 

  7. Ershov,A.P.: Introduction in the theory of programming(in Russian). Nauka, Moskow, 1977.

    Google Scholar 

  8. Greibach,S.A.: Theory of Program Structures: Schemes, Semantics, Verification. LNCS 36, Springer, Berlin, 1975.

    Google Scholar 

  9. Keller,R.M.: Parallel program schemata and maximal parallelism. Journal of ACM, 20,1973, 514–537, 696–710.

    Google Scholar 

  10. Kotov,V.E.: On Basic Parallel Language. IFIP Congress 1980, North Holland Publishing Company, Amsterdam, 1980.

    Google Scholar 

  11. Lau,S.: Ansätze und Methoden zur Ressourcenabschätzung in Datenfiußsystemen. Ph.D. Thesis, Dresden University of Technology, 1991.

    Google Scholar 

  12. Son,T.C.: Realisierungen nichtdeterministischer Wortfunktionen. Master Thesis, Dresden University of Technology, 1989.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Science, Cottbus University of Technology, P.O. Box 10 13 44, D-03013, Cottbus

    Peter Bachmann

Authors
  1. Peter Bachmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dines Bjørner Manfred Broy Igor V. Pottosin

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bachmann, P. (1996). On the power of recursion in dataflow Schemes. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-62064-8_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-62064-8

  • Online ISBN: 978-3-540-49637-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation