Skip to main content

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 78))

  • 52 Accesses

Abstract

Abstract procedures merely defined by their input/output behaviour are interconnected using buffered communication. Determinacy of such procedures is defined, and conditions for determinacy of composed procedures are given.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 59.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference

  1. D.A. Adams: A Computation Model with Data Flow Sequencing. Ph.D. thesis, Stanford Univ. 1968

    Google Scholar 

  2. L.L. Constantine: Control of Sequence and Parallelism in Modular Programs. SJCC 1968 AFIPS Conf. Proc. Vol. 32

    Google Scholar 

  3. P. Brinch Hansen: The Nucleus of a Multiprogramming System. CACM 13, 4 (1970)

    Google Scholar 

  4. P. Brinch Hansen: Structured Multiprogramming. CACM 15, 7 (1972)

    Google Scholar 

  5. R.M. Karp/R.E. Miller: Parallel Program Schemata. JCSS 3 (1969)

    Google Scholar 

  6. K.-P. Loehr: Gepufferte Kommunikation in abstrakten Systemen. Bericht BS 2, Fachber. Kybern., Techn. Univ. Berlin 1972

    Google Scholar 

  7. F.L. Luconi: Asynchronous Computational Structures. Ph.D. thesis, Project MAC, M.I.T. 1968

    Google Scholar 

  8. E. Morenoff/J.E. McLean: Interprogram Communications, Program String Structures, and Buffer Files. SJCC 1967, AFIPS Conf. Proc. Vol. 30

    Google Scholar 

  9. S.S. Patii: Closure Properties of Interconnections of Determinate Systems. Project MAC Conf. on Concurrent Systems and Parallel Computation 1970

    Google Scholar 

  10. J.E. Rodriguez-Bezos: A Graph Model for Parallel Computations. Sc.D. thesis, Project MAC, M.I.T. 1967

    Google Scholar 

  11. M.J. Spier/E.I. Organick: The Multics Interprocess Communication Facility. ACM 2nd Symp. on Operating System Principles, Princeton 1969

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1973 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Löhr, KP. (1973). Modularity of Non-Sequential Programs. In: Deussen, P. (eds) GI. Gesellschaft für Informatik e.V. 2. Jahrestagung. Lecture Notes in Economics and Mathematical Systems, vol 78. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80732-9_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80732-9_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-06127-4

  • Online ISBN: 978-3-642-80732-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics