Advertisement

Metric spaces as models for real-time concurrency

  • G. M. Reed
  • A. W. Roscoe
Part IV Domain Theory And Theoretical Computation
Part of the Lecture Notes in Computer Science book series (LNCS, volume 298)

Abstract

We propose a denotational model for real time concurrent systems, based on the failures model for CSP. The fixed point theory is based on the Banach fixed point theorem for complete metric spaces, since the introduction of time as a measure makes all recursive operators naturally contractive. This frees us from many of the constraints imposed by partial orders on the treatment of nondeterminism and divergence.

Keywords

Partial Order Nonexpansive Function Fixed Point Theory Recursive Operator Nondeterministic Choice 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [Bo]
    A. Boucher, A time-based model for occam, Oxford University D.Phil. thesis 1986.Google Scholar
  2. [Brookes]
    S.D. Brookes, A model for communicating sequential processes, Oxford University D.Phil. thesis 1983.Google Scholar
  3. [Broy]
    M. Broy, Fixed point theory for communication and concurency, TC2 Working Conference on Formal Description of Programming Concepts II, Garmisch, 1982.Google Scholar
  4. [BHR]
    S.D. Brookes, C.A.R. Hoare and A.W. Roscoe, A theory of communicating sequential processes, JACM 31 (1894), 560–599.CrossRefGoogle Scholar
  5. [BR]
    S.D. Brookes and A.W. Roscoe, An improved failures model for communicating processes, Proceedings of the Pittsburgh Seminar on Concurrency, Springer LNCS 197 (1985).Google Scholar
  6. [BZ]
    J.W. de Bakker and J.I. Zucker, Processes and the denotational semantics of concurrency, Information and Control 54 (1982), 70–120.CrossRefGoogle Scholar
  7. [GR]
    W.G. Golson and W.C. Rounds, Connections between two theories of concurrency: metric spaces and synchronisation trees, Information and Control 57 (1983), 102–124.CrossRefGoogle Scholar
  8. [H1]
    C.A.R. Hoare, A model for communicating sequential processes, On the construction of programs CUP (1980), 229–248.Google Scholar
  9. [H2]
    C.A.R. Hoare, Communicating sequential processes, Prentice-Hall International, 1985.Google Scholar
  10. [J]
    G. Jones, A timed model for communicating processes, Oxford University D.Phil thesis, 1982.Google Scholar
  11. [KSdRGA-K]
    R. Koymans, R.K. Shyamasundar, W.P. de Roever, R. Gerth and S. Arun-Kumar, Compositional semantics for real-time distributed computing Faculteit der Wiskunde en Natuurwetenschappen, Katholieke Universiteit, Nijmegen, Technical report 68, 1985.Google Scholar
  12. [N]
    M. Nivat, Infinite words, infinite trees, infinite computations, Foundations of Computer Science III (Math. Centre Tracts 109, 1979), 3–52.Google Scholar
  13. [OH]
    E.R. Olderog and C.A.R. Hoare, Specification-oriented semantics for communicating processes, Springer LNCS 154 (1983), 561–572.Google Scholar
  14. [P]
    I. Phillips, Refusal testing, Proceedings of ICALP'86, Springer LNCS 226 (1986), 304–313.Google Scholar
  15. [Ros]
    A.W. Roscoe, A mathematical theory of communicating processes, Oxford University D.Phil thesis 1982.Google Scholar
  16. [Rou]
    W.C. Rounds, Applications of topology to the semantics of communicating processes, Proceedings of the Pittsburgh Seminar on Concurrency, Springer LNCS 197 (1985).Google Scholar
  17. [RR]
    G.M. Reed and A.W. Roscoe, A timed model for communicating sequential processes, Proceedings of ICALR'86, Springer LNCS 226 (1986), 314–323.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • G. M. Reed
    • 1
  • A. W. Roscoe
    • 1
  1. 1.Oxford University Computing LaboratoryOxfordU.K.

Personalised recommendations