Skip to main content
SpringerLink
Log in

Über die Lebensdauer von Prozessen in Nichtsequentiellen Algorithmen

  • Chapter
GI-4.Jahrestagung

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

  • 831 Accesses

Abstract

Semantics and implementation of cobegin/coend-constructs such as the “concurrent statement” (Dijkstra, Brinch Hansen) are investigated. It is shown that common interpretation of the concurrent statement confuses specification of concurrency and creation of processes. A language feature is proposed which allows for reducing the meaning of “concurrent blocks/compounds” to specification of concurrency while realizing implicit creation of processes in due time.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 49.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.

Literatur

  1. D.A. Adams: A Computation Model with Data Flow Sequencing. Ph.D. thesis, Stanford Univ. 1968. Auszug in L.C. Hobbs et al.: Parallel Processor Systems, Technologies, and Applications. Spartan Books 1970.

    Google Scholar 

  2. P. Ancilotti, M. Fusani, N. Lijtmaer, C. Thanos: Deadlock Conditions in Well Structured Modular Systems. 4. GI-Jahrestagung Berlin 1974.

    Google Scholar 

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

    Article  Google Scholar 

  4. P. Brinch Hansen: Operating System Principles. Prentice-Hall 1973.

    Google Scholar 

  5. Burroughs Corporation: Extended ALGOL Reference Manual. Detroit 1968.

    Google Scholar 

  6. M.E. Conway: A Multiprocessor System Design. Fall Joint Computer Conference 1963.

    Google Scholar 

  7. O.J. Dahl, B. Myhrhaug, K. Nygaard: SIMULA 67 Common Base Language. Norsk Regnesentral, Oslo 1970.

    Google Scholar 

  8. J.B. Dennis, E.C. van Horn: Programming Semantics for Multiprogrammed Computations. CACM 9, 3 (1966).

    Article  Google Scholar 

  9. J.B. Dennis, J.B. Fosseen: Introduction to Data Flow Schemas. Memo 81, Computation Structures Group, Project MAC, M.I.T. 1973.

    Google Scholar 

  10. E.W. Dijkstra: Co-operating Sequential Processes. Report EWD 123, Dept. of Math., Techn. Univ. Eindhoven 1965. Abgedruckt im F. Genuys (ed.): Programming Languages. Academic Press 1968.

    Google Scholar 

  11. C.A.R. Hoare/R.H. Perrott: Operating Systems Techniques. Academic Press 1972.

    Google Scholar 

  12. IBM Corporation: PL/I Reference Manual, 1966.

    Google Scholar 

  13. K.-P. Löhr: Datenflußgesteuerte Koppelung nichtsequentieller Systeme. Diss. Fachbereich Kybernetik, TU Berlin 1974.

    Google Scholar 

  14. A. van Wijngaarden, B.J. Mailloux, J.E.L. Peck, C.H.A. Koster: Report on the Algorithmic Language ALGOL 68. Numerische Mathematik 14 (1969).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Kybernetik, Technische Universität Berlin, Deutschland

    Klaus-Peter Löhr

Authors
  1. Klaus-Peter Löhr
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automatentheorie und Formale Sprachen, Fachbereich Kybernetik, Technische Universität Berlin, Otto-Suhr-Allee 18/20, 1 Berlin 10, Deutschland

    Dirk Siefkes

Rights and permissions

Reprints and permissions

Copyright information

© 1975 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Löhr, KP. (1975). Über die Lebensdauer von Prozessen in Nichtsequentiellen Algorithmen. In: Siefkes, D. (eds) GI-4.Jahrestagung. Lecture Notes in Computer Science, vol 26. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-40087-6_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-40087-6_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-39104-4

  • Online ISBN: 978-3-662-40087-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation