Skip to main content
SpringerLink
Log in

Extensional Behaviour of Concurrent, Nondeterministic, Communicating Systems

  • Conference paper
Control Flow and Data Flow: Concepts of Distributed Programming

Part of the book series: Springer Study Edition ((SSE,volume 14))

Abstract

A simple denotational model for nondeterministic communicating, concurrent agents is introduced that allows to represent the extensional behaviour of communicating agents. Based on this model several concepts of program correctness are introduced analysed and related to classical concepts. Observability concepts are discussed for an operational semantics given in the form of labelled rewriting systems. In particular the close connections between domain theory and fixed point theory for concurrent programs and concepts of correctness are investigated and outlined, and generalizations of the notions of partial and total correctness are given.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

References

  1. J. D. Brooks, W. B. Ackermann: Scenarios: A Model of Non-Determinate Computation. In: J. Diaz, I. Ramos (eds.): Formalization of Programming Concepts, Peniscola 1981, Lecture Notes in Computer Science 107, Berlin-Heidelberg-New York: Springer 1981, 252–259

    Google Scholar 

  2. S.D. Brookes, W.C. Rounds: Possible Futures, Refusals and Communicating Processes. Proceedings of 22nd Annual IEEE Symposium on Foundation of Computer Science (1981)

    Google Scholar 

  3. S.D. Brookes, W.C. Rounds: Behavioural Equivalence Relations Induced by Programming Logics, In: J.Diaz (ed.): Proc. ICALP 1983, Lecture Notes in Computer Science 154, Berlin-Heidelberg-New York: Springer 1983, 97–108

    Google Scholar 

  4. M. Broy: Transformational Semantics for Concurrent Programs. IPL 11:2, Oktober 1980, 87–91

    Google Scholar 

  5. M.Broy: A Fixed Point Approach to Applicative Multiprogramming. In: M Broy, G.Schimdt (eds.): Theoratical Foundations of Programming Methodology, Reidel Publ. Comp. 1982, 565–623

    Google Scholar 

  6. M. Broy: Denotational Semantics of Communicating Processes based on a Language for Applicative Multiprogramming. IPL 17: 1 1983, 29–38

    MathSciNet  MATH  Google Scholar 

  7. M. Broy: Fixed Point Theory for Communication and Concurrency. In: D. Bjórner (ed.): IFIP TC2 Working Conference on Formal Description of Programming Concepts II, Garmisch, June 1982, Amsterdam-New York-Oxford: North Holland Publ. Company 1983, 125–147

    Google Scholar 

  8. M. Broy: Applicative Real Time Programming. In: R.E.A. Mason (ed.): Information Processing 83, 259–264

    Google Scholar 

  9. M. Broy: Semantics of Communicating Processes. Information and Control (to appear)

    Google Scholar 

  10. M. Broy: Denotational Semantics of Concurrent Programs with Shared Memory. In: M.Fontet, K. Mehlhorn (eds.): STACS 84, Lecture Notes in Computer Science 166, Berlin-Heidelberg-New York: Springer 1984, 163–173

    Google Scholar 

  11. M. Broy, M. Wirsing: On the Algebraic Specification of Nondeterministic Programming Languages. In: E. Astesiano, C. Böhm (eds.): 6th Colloquium on Tress in Algebra and Programming. Lecture Notes in Computer Science 112, Berlin-Heidelberg-New York: Springer 1981, 162–179

    Google Scholar 

  12. M. Broy, M. Wirsing: On the Algebraic Specification of Finitary Infinite Communicating Sequential Processes. In: D.Björner (ed.): IFIP TC 2 Working Conference on Formal Description of Programming Concepts II, Garmisch, June 82, Amsterdam-New York-Oxford: North Holland Publ. Company 1983, 171–196

    Google Scholar 

  13. J.B. Dennis: First Version of a Data Flow Procedure Language. In B. Robinet (ed.): Colloque sur la Programmation, Lecture Notes in Computer Science 19, Berlin-Heidelberg-New York: Springer 1974, 362–367.

    Google Scholar 

  14. E.W. Dijkstra: A Discipline of Programming. Prentice Hall, Englewood Cliffs 1976

    MATH  Google Scholar 

  15. R.W. Floyd: Assigning Meanings to Programs. In: J.T. Schwartz (ed.): Mathematical Aspects of Computer Science. Proc. Symposia in Applied Mathematics, Vol. XIX, 1966 Providence. R. I.: American Mathematical Society 1967, 19–32

    Google Scholar 

  16. E.C.R. Hehner: Predicative Programming Part I+II. CACM 27: 2 (1984) 134–151

    MathSciNet  MATH  Google Scholar 

  17. M.C.B. Hennessy: A Term Model for Synchronous Processes. University of Edinburgh, Department of Computer Science, Internal Report CSR-77–81, 1981

    Google Scholar 

  18. M. Hennessy: Powerdom sins and Nondeterministic Recursive Definitions.International Symposium on Programming 1982, Lecture Notes in Computer Science 137, Berlin-Heidelberg-New York: Springer 1982

    Google Scholar 

  19. M.C.B. Hennessy, R. Milner: On Observing Nondeterminism and Concurrency. In: J.W. deBakker, J. van Leeuwen (eds.): ICALP 80, Lecture Notes in Computer Science 85, Berlin-Heidelberg-New York: Springer 1980, 299–309

    Google Scholar 

  20. M.C.B. Hennessy, G.D. Plotkin: Full Abstraction for Simple Parallel Programs. 8th MFCS, Olmouc, Lecture Notes in Computer Science 74, Berlin-Heidelberg-New York: Springer 1979

    Google Scholar 

  21. M.C.B. Hennessy, G.D. Plotkin: A Term Model for CCS. 9th MFCS (1980), Lecture Notes in Computer Science 88, Berlin-Heidelberg-New York: Springer 1980, 261–274.

    Google Scholar 

  22. C.A.R. Hoare: An Axiomatic Basis for Computer Programming. Comm. ACM 12: 10, Oct.1969, 576–583

    Article  Google Scholar 

  23. C.A.R. Hoare: Towards a Theory of Parallel Programming. In: C.A.R. Hoare, R.H. Perott (eds.): Operating Systems Techniques, Academic Press, New York 1972, 61–71

    Google Scholar 

  24. C.A.R. Hoare, S.D. Brookes, A.W. Roscoe: A Theory of Communicating Sequential Processes. Oxford University Computing Laboratory, Programming Research Group, Technical Monograph PRG-21, Oxford 1981

    Google Scholar 

  25. G. Kahn, D. MacQueen 77: Coroutines and Networks of Parallel Processes. In: Proc. of the IFIP Congress 77, Amsterdam: North-Holland 1977, 994–998

    Google Scholar 

  26. R. M. Keller: Denotational Models for Parallel Programs with Indeterminate Operators. In: E. J. Neuhold (ed.): Formal Descriptin of Programming Concepts. Amsterdam: North-Holland 1978, 337–366

    Google Scholar 

  27. R.M. Keller: Semantics and Applications of Function Graphs. University of Utah, Department of Computer Science, Technical Report UUCS-80–112, October 1980

    Google Scholar 

  28. P.R. Kosinski: A Data Flow Language for Operating Systems Programming. SIGPLAN Notices 8: 9, September 1973, 89–94

    Article  Google Scholar 

  29. D.B. MacQueen: Models for Distributed Computing. IRIA RR No 351, April 1979

    Google Scholar 

  30. J. McCarthy: A Basis for a Mathematical Theory of Computation. In: P. Braffort, D. Hirshberg (eds.): Computer Programming and Formal Systems. North-Holland 1963, 33–70

    Google Scholar 

  31. G. Milne, R. Milner: Concurrent Processes and their Syntax. University of Edinburgh, Department of Computer Science, Internal Report CSR-2–77, 1977

    Google Scholar 

  32. R. Milner: A Calculus of Communicating Systems Lecture Notes in Computer Science 92, Berlin-Heidelberg-New York: Springer

    Google Scholar 

  33. R. Milner: On Relating Synchrony and Asynchrony. University of Edinburgh,Department of Computer Science, Internal Report CSR-75–80, December 1980

    Google Scholar 

  34. R. de Nicola, M.C.B. Hennessy: Testing Equivalences for Processes. In: J.Diaz (ed.): Proc. ICALP 1983 Lecture Notes in Computer Science 154, Berlin-Heidelberg-New York: Springer 1983, 548–560

    Google Scholar 

  35. M. Nielsen, G. Plotkin, G. Winskel: Petri Nets, Event Structures, and Domains. Part 1. Theoretical Computer Science 13, 1981, 85–108

    Article  MathSciNet  MATH  Google Scholar 

  36. G. Plotkin: A Powerdomain Construction. SIAM J. Computing 5, 1976, 452–486

    MathSciNet  MATH  Google Scholar 

  37. A. Pnueli: The Temporal Logic of Programs. Proc 18th FOCS, Providence, 1977, 46–57

    Google Scholar 

  38. V.R. Pratt: Process Logic. 6th Popl, 1979, 83–100

    Google Scholar 

  39. M. Smyth: Power Domains. J. CSS 16, 1978, 23–36

    MathSciNet  MATH  Google Scholar 

  40. G. Winskel: Event Structure Semantics of CCS and Related Languages. In: M.Nielsen, E.M.Schmidt (eds.): ICALP 82 Lecture Notes in Computer Science 140, Berlin-Heidelberg New York 1982, 561–576

    Google Scholar 

  41. G. Winskel: Categories of Synchronisation Trees and Transition Systems. In: J.Diaz (ed.): Proc. ICALP 1983, Lecture Notes in Computer Science 154, Berlin-Heidelberg-New York: Springer 1983, 695–711

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fakultät für Informatik, Universität Passau, Postfach 25 40, 8390, Passau, Germany

    Manfred Broy

Authors
  1. Manfred Broy
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Fakultät für Mathematik und Informatik, Universität Passau, Postfach 2540, 8390, Passau, Federal Republic of Germany

    Manfred Broy

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Broy, M. (1986). Extensional Behaviour of Concurrent, Nondeterministic, Communicating Systems. In: Broy, M. (eds) Control Flow and Data Flow: Concepts of Distributed Programming. Springer Study Edition, vol 14. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82921-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82921-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17082-2

  • Online ISBN: 978-3-642-82921-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation