Skip to main content
SpringerLink
Log in

The semantics of priority and fairness in occam

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1989)

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

Abstract

This paper presents an operational semantics for priority and fairness in occam. The semantics is based on the state transitions made by a transputer in the execution of an occam program. It is possible to abstract sufficiently from the transputer implementation that a clear semantics is produced but to maintain enough detail that the particular meanings intended for priority and fairness can be expressed precisely as the practical programmer would understand them.

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. Baeten, J.C.M., Bergstra, J.A. & Klop, J.W., Syntax and Defining Equations for an Interrupt Mechanism in Process Algebra. Technical Report CS-R8503, Department of Computer Science, Center for Mathematics and Computer Science, Amsterdam, February 1985

    Google Scholar 

  2. Barrett, G., The Semantics and Implementation of occam. Thesis DPhil, Oxford, September 1988

    Google Scholar 

  3. Barrett, G., Goldsmith, M.H., Jones, G. & Kay, A., The Meaning and Implementation of PRI ALT in occam. in occam and the Transputer — Research and Applications, ed. C Askew, IOS, Amsterdam, 1988

    Google Scholar 

  4. Brookes, S.D., Roscoe, A.W. & Walker, D.J., An Operational Semantics for CSP, forthcoming

    Google Scholar 

  5. Camilleri, J., An Operational Semantics for occam. University of Cambridge, Computer Laboratory Technical Report 144, August 1988

    Google Scholar 

  6. Cleaveland, R. & Hennessy, M., Priorities in Process Algebras. Report No. 2/88, Computer Science, University of Sussex, March 1988

    Google Scholar 

  7. Francez, N., Fairness. Springer Verlag, New York, 1986

    Google Scholar 

  8. Roscoe, A.W., A Denotational Semantics for occam. in Seminar on Concurrency, ed. S.D. Brookes, A.W. Roscoe, & G. Winskel, Lecture Notes in Computer Science, vol. 197, pp. 306–329, Springer Verlag, Berlin, 1985

    Google Scholar 

  9. Roscoe, A.W., Routing messages through networks: an exercise in deadlock avoidance. in Proc. 7th o UG Tech. Meeting, ed. T. Muntean, Grenoble, September 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Research Group, Oxford University Computing Laboratory, 11 Keble Road, OX1 3QD, Oxford

    Geoff Barrett

Authors
  1. Geoff Barrett
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

M. Main A. Melton M. Mislove D. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barrett, G. (1990). The semantics of priority and fairness in occam. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1989. Lecture Notes in Computer Science, vol 442. Springer, New York, NY. https://doi.org/10.1007/BFb0040258

Download citation

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

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97375-3

  • Online ISBN: 978-0-387-34808-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation