Skip to main content
Springer Nature Link
Log in

Infinite streams and finite observations in the semantics of uniform concurrency

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1985)

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

Included in the following conference series:

  • 126 Accesses

Abstract

Two ways of assigning meaning to a language with uniform concurrency are presented and compared. The language has uninterpreted elementary actions from which statements are composed using sequential composition, nondeterministic choice, parallel composition with communication, and recursion. The first semantics uses infinite streams in the sense which is a refinement of the linear time semantics of De Bakker et al. The second semantics uses the finite observations of Hoare et al., situated “in between” the divergence and readiness semantics of Olderog & Hoare. It is shown that the two models are isomorphic and that this isomorphism induces an equivalence result between the two semantics.

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. R.J.R. Back, A Continuous Semantics for Unbounded Nondeterminism, Theoret. Comp. Sci. 23 (1983) 187–210.

    Article  Google Scholar 

  2. J.W. de Bakker, Mathematical Theory of Program Correctness (Prentice Hall International, London, 1980).

    Google Scholar 

  3. J.W. de Bakker, J.A. Bergstra, J.W. Klop, J.-J. Ch. Meyer, Linear Time and Branching Time Semantics for Recursion with Merge, TCS 34 (1984) 135–156.

    Article  Google Scholar 

  4. J.W. de Bakker, J.I. Zucker, Processes and the Denotational Semantics of Concurrency, Inform. and Control 54 (1982) 70–120.

    Article  Google Scholar 

  5. J.W. de Bakker, J.-J. Ch. Meyer, E.-R. Olderog, J.I. Zucker, Transition Systems, Infinitary Languages and the Semantics of Uniform Concurrency, to appear in: Proc. 17th ACM STOC, Providence, R.I., 1985.

    Google Scholar 

  6. J.A. Bergstra, J.W. Klop, Process Algebra for Synchronous Communication, Information and Control, 60 (1984), pp. 109–137.

    Article  Google Scholar 

  7. S.D. Brookes, C.A.R. Hoare, A.W. Roscoe, A Theory of Communicating Sequential Processes, J. ACM 31 (1984) 560–599.

    Article  Google Scholar 

  8. M. Broy, Fixed Point Theory for Communication and Concurrency, in: D. Bjørner (Ed.), Formal Description of Programming Concepts II (North-Holland, Amsterdam, 1983) 125–146.

    Google Scholar 

  9. N. Francez, C.A.R. Hoare, D.J. Lehmann, W.P. de Roever, Semantics of Nondeterminism, Concurrency and Communicating, JCSS 19 (1979) 290–308.

    Google Scholar 

  10. N. Francez, D.J. Lehmann, A. Pnueli, A Linear History Semantics for Languages for Distributed Programming, Theoret. Comp. Sci. 32 (1984) 25–46.

    Article  Google Scholar 

  11. M.C.B. Hennessy, Synchronous and Asynchronous Experiments on Processes, Report CSR-125-82, Dept. of Comp. Sci., Univ. of Edinburgh, 1982.

    Google Scholar 

  12. M.C.B. Hennessy, An Algebraic Theory of Fair Asynchronous Communicating Processes, Manuscript, Dept. of Comp. Sci., Univ. of Edinburgh, 1984.

    Google Scholar 

  13. J.-J. Ch. Meyer, Fixed Points and the Arbitrary and Fair Merge of a Fairly Simple Class of Processes, Tech. Report IR-89/IR-92, Free University, Amsterdam, 1984.

    Google Scholar 

  14. R. Milner, A Calculus of Communicating Systems, LNCS 92 (Springer, Berlin, 1980).

    Google Scholar 

  15. R. Milner, Calculi for Synchrony and Asynchrony, Theoret. Comp. Sci. 25 (1983) 267–310.

    Article  Google Scholar 

  16. R. de Nicola, M.C.B. Hennessy, Testing Equivalences for Processes, TCS 34 (1984) 83–134.

    Article  Google Scholar 

  17. M. Nivat, Infinite Words, Infinite Trees, Infinite Computations, Foundations of Computer Science III. 2, Mathematical Centre Tracts 109 (1979) 3–52.

    Google Scholar 

  18. E.-R. Olderog, C.A.R. Hoare, Specification-oriented Semantics for Communicating Processes, in: J. Diaz (Ed.), Proc. 10th ICALP, LNCS 154 (Springer, Berlin, 1983) 561–572.

    Google Scholar 

  19. E.-R. Olderog, C.A.R. Hoare, Specification-oriented Semantics for Communicating Processes, Tech. Monograph PRG-37, Prog. Research Group, Oxford Univ., 1984 (to appear in Acta Informatica).

    Google Scholar 

  20. G.D. Plotkin, Dijkstra's Predicate Transformers and Smyth's Power Domains, in: D. Bjørner (Ed.), Abstract Software Specification, LNCS 86 (Springer, Berlin, 1980) 527–553.

    Google Scholar 

  21. M.B. Smyth, Power Domains, JCSS 16 (1978) 23–26.

    Google Scholar 

  22. G. Winskel, Synchronisation Trees, TCS 34 (1984) 33–82.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science, Free University, Amsterdam

    J. W. de Bakker

  2. Free University, Amsterdam

    J. -J. Ch. Meyer

  3. Christian-Albrechts-Universität Kiel, Germany

    E. -R. Olderog

Authors
  1. J. W. de Bakker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. -J. Ch. Meyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. E. -R. Olderog
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wilfried Brauer

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Bakker, J.W., Ch. Meyer, J.J., Olderog, E.R. (1985). Infinite streams and finite observations in the semantics of uniform concurrency. In: Brauer, W. (eds) Automata, Languages and Programming. ICALP 1985. Lecture Notes in Computer Science, vol 194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015740

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-15650-5

  • Online ISBN: 978-3-540-39557-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation