Skip to main content
SpringerLink
Log in

Specification and design of shared resource arbitration

  • Published:
International Journal of Parallel Programming Aims and scope Submit manuscript

Abstract

The specification, modular design and verification of distributed communicating systems is demonstrated by an example. The scheduling of the access to a common shared resource by a finite number of devices with priorities is a well known problem from hardware and operating systems design. Using the concepts of stream processing continuous function a variety of formal requirement and design specifications for this problem are given and the design specifications are proven correct w.r.t the requirement specifications. From the design specifications one can immediately read off applicative programs implementing the requirement specifications. Special attention is paid to the aspect of modelling time.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. F. Kröger, Temporal Logic of Programs,EATCS Monographs in Computer Science, Vol. 8, Springer (1987).

  2. M. Broy, A Theory of Nondeterminism, Parallelism, Communication and Concurrency,TCS,45:1–61 (1986).

    Google Scholar 

  3. M. Broy, Semantics of Finite and Infinite Networks of Communicating Agents,Distributed Computing,2:13–31 (1987).

    Google Scholar 

  4. G. Kahn, The Semantics of a Simple Language for Parallel Programming. Information Processing 74,Proc. of the IFIP Congress, North-Holland, New York, pp. 471–475 (1974).

    Google Scholar 

  5. W. W. Wadge and E. A. Ashcroft,Lucid, the Dataflow Programming Language, Academic Press (1985).

  6. M. Broy, Predicative Specification for Functional Programs Describing Communicating Networks,Information Processing Letters,25:93–101 (1987).

    Google Scholar 

  7. P. Caspi and N. Halbwachs, A Functional Model for Describing and Reasoning about Time Behaviours in Computing Systems,Acta Informatica,22: 6, 595–628, (1985).

    Google Scholar 

  8. D. Park, The “Fairness” Problem and Nondeterministic Computing Networks. Foundations of Computer Science IV, Part 2, Amsterdam,Math. Centre Tracts,159:133–161 (1982).

    Google Scholar 

  9. F. Boussinot, Résaux de processus avec mélange équitable: une approche du temps réel, Université Paris VIII, Thèse de Doctorat d'Etat (June 1981).

  10. M. Broy, Views of queues,Science of Computer Programming,11:65–86 (1988).

    Google Scholar 

  11. M. Broy, Applicative Real Time Programming (ed.) R. E. A. Mason,IFIP,83:259–264.

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Technische Universität München, Postfach 20 24 20, 8, München 2, Germany

    Manfred Broy

  2. Fakultät für Mathematik und Informatik, Universität Passau, Innstr 27, 8390, Passau, Germany

    Thomas Streicher

Authors
  1. Manfred Broy
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Streicher
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Broy, M., Streicher, T. Specification and design of shared resource arbitration. Int J Parallel Prog 20, 1–22 (1991). https://doi.org/10.1007/BF01407930

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01407930

Key Words

Search

Navigation