Advertisement

Views of distributed systems

  • Manfred Broy
  • Thomas Streicher
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 280)

Abstract

A number of distinct views of distributed systems and ways for their formal modelling are explained, discussed, and related. By this, in particular, an attempt is undertaken to unify and show the connection between distinct approaches to formalizing distributed systems and programs describing them.

Keywords

Causality Structure Semantic Model Operational Semantic Conveyor Belt Parallel Composition 
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.

References

  1. [Broy 84]
    M. Broy: Semantics of communicating processes. Information & Control 61:3 (1984) 202–246.Google Scholar
  2. [Broy, Bauer 85]
    M. Broy, F.L. Bauer: A systematic approach to language constructs for concurrency. SCP 1985Google Scholar
  3. [Degano et al. 85]
    P. Degano, R. De Niccola, U. Montanari: Partial ordering derivations for CCS. FCT 85, Lecture Notes in Computer Science 199, Berlin-Heidelberg-New York-Tokyo: Springer 1985, 520–533Google Scholar
  4. [Degano, Montanari 85]
    P. Degano, U. Montanari: Distributed systems, partial ordering of events, and event structures. In: M. Broy: Control Flow and Data Flow: Concepts of Distributed Programming. NATO ASI Series, Series F: Computer and System Sciences, Vol. 14, Berlin-Heidelberg-New York-Tokyo: Springer 1985, 7–106Google Scholar
  5. [Hennessy, Plotkin 79]
    M.C.B. Hennessy, G.D. Plotkin: Full abstraction for simple parallel programs. 8th Mathematical Foundations of Computer Science, Olomouc, 1979, Lecture Notes in Computer ScienceGoogle Scholar
  6. [Hennessy, Milner 80]
    M.C.B. Hennessy, R. Milner: On observing nondeterminism and concurrency. In: J. de Bakker, Jn van Leeuwen: International Colloquium on Automata, Languages and Programming 80, Lecture Notes in Computer Science 85, Berlin-Heidelberg-New York: Springer 1980, 299–309.Google Scholar
  7. [Hennessy, Plotkin 80]
    M. Hennessy, G. Plotkin: A term model for CCS. 9th Mathematical Foundations of Computer Science (1980), Lecture Notes in Computer Science 88, Berlin-Heidelberg-New York: Springer 1980, 261–274.Google Scholar
  8. [Hoare 78]
    C.A.R. Hoare: Communicating sequential processes, Comm. ACM 21 (8) (1978) 666–667.CrossRefGoogle Scholar
  9. [Hoare et al. 81]
    C.A.R: Hoare, S.D. Brookes and A.W. Roscoe: A theory of communicating sequential processes. Oxford University Computing Laboratory, Programming Research Group, Technical Monograph PRG-21, Oxford (1981). Also in: J. ACM 31 (1984) 560–599Google Scholar
  10. [Hoare 85]
    C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall 1985Google Scholar
  11. [Kahn, MacQueen 77]
    G. Kahn and D. MacQueen, Coroutines and networks of processes, Proc. IFIP Congress 1977Google Scholar
  12. [Mazurkiewicz 85]
    A. Mazurkiewicz: Traces, histories, graphs: instances of a process monoid. In: M.P. Chytil, V. Koubek (eds.): MFCS 1984, Lecture Notes in Computer Science 92, Berlin-Heidelberg-New York-Tokyo: Springer 1985, 115–133Google Scholar
  13. [MacQueen 79]
    D.B. MacQueen, Models for distributed computing, IRIA RR No. 351 (1979).Google Scholar
  14. [Milner 80]
    R. Milner: A Calculus for Communicating Systems, Lecture Notes in Computer Science 92, Berlin-Heidelberg-New York-Tokyo: Springer 1980Google Scholar
  15. [Milner 80b]
    R. Milner: On relating synchrony and asynchrony. University of Edinburgh, Department of Computer Science, Internal Report CSR-75-80, December 1980Google Scholar
  16. [Nielsen et al. 81]
    M. Nielsen, G. Plotkin, G. Winskel: Petri nets, event structures, and domains. Part 1. Theoretical Computer Science 13, 1981, 85–108CrossRefGoogle Scholar
  17. [Olderog, Hoare 82]
    E.-R. Olderog, C.A.R. Hoare: Specification-oriented semantics for communicating processes. In: Diaz: International Colloquium on Automata, Languages and Programming 83, Lecture Notes in Computer Sciences, Berlin-Heidelberg-New York: Springer 1983Google Scholar
  18. [Tesler, Enea 68]
    L.G. Tesler and H.J. Enea: A language design for concurrent processes, Spring Joint Computer Conference (1968) 403–408.Google Scholar
  19. [Winkowski 80]
    J. Winkowski: Behaviors of concurrent systems. Theoretical Computer Science 11, 1980, 39–60.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Manfred Broy
    • 1
  • Thomas Streicher
    • 1
  1. 1.Fakultät für Mathematik und InformatikUniversität PassauPassau

Personalised recommendations