Advertisement

Distributed Systems, Partial Orderings of Events, and Event Structures

  • Pierpaolo Degano
  • Ugo Montanari
Conference paper
Part of the Springer Study Edition book series (volume 14)

Abstract

These lecture notes are divided in two parts, dedicated to two models, concurrent histories and Graphs for Distributed Systems (GDS), both based on partial orderings. The models are largely consistent, the latter being a richer version of the former, conceived as a specification formalism for distributed systems. The semantic aspects of the first model are studied in finer detail, including properties of non terminating computations and the definition of an observational equivalence.

Keywords

Transition System Cauchy Sequence Transition Rule Label Transition System Graph Grammar 
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. 1.
    Astesiano,E., Mascari,G.F., Reggio,G. and Wirsing,M., On the Parametrized Algebraic Specification of Concurrent Systems, to appear in Proc. CAAP 1985, LNCS, Springer-Verlag, Berlin.Google Scholar
  2. 2.
    Austry,D., and Boudol,G. Algebra de Processus et Synchronization, TCS 30(1984), 91–137.MathSciNetMATHGoogle Scholar
  3. 3.
    Brams,G.W. Réseaux de Petri: Théorie et Pratique Vol. I and II, Masson, Paris, 1983.Google Scholar
  4. 4.
    Broy,M. Semantics of Communicating Processes, Internal Report, Technische Universität München, München, 1983, to appear in Info. and Co.Google Scholar
  5. 5.
    Castellani,I. Bisimulations and Abstraction Homomorphisms, to appear in Proc. CAAP 1985, LNCS, Springer-Verlag, Berlin.Google Scholar
  6. 6.
    Castellani,I., Franceschi,P., and Montanari,U. Labeled Event Structures: A Model for Observable Concurrency, Proc. IFIP TC 2–Working Conference: Formal Description of Programming Concepts II (D. Bj$rner Ed.), Garmisch–Partenkirchen, 1982, North-Holland, Amsterdam, 1983, pp. 383–400.Google Scholar
  7. 7.
    Castellani,I., and Montanari,U. Graph Grammars for Distributed Systems, Proc. 2nd Int. Workshop on Graph-Grammars and their Applications to Computer Science (H. Ehrig, M.A. Nagel, and G. Rozenberg Eds), Haus Ohrbech, Germany, October 1982, LNCS, 153, Springer-Verlag, Berlin, 1983, pp. 20–38.Google Scholar
  8. 8.
    Costa,G. A Metric Characterization of Fair Computations in CCS, to appear in Proc. CAAP 1985, LNCS, Springer-Verlag, Berlin.Google Scholar
  9. 9.
    Darondeau,Ph., and Kott,L. On the Observational Semantics of Fair Parallelism, Proc. 10th ICALP (J. Diaz Ed.), LNCS, 154, Springer-Verlag, Berlin, 1983, pp. 147–151.Google Scholar
  10. 10.
    de Bakker,J.W., and Zucker,J.I. Processes and the Denotational Semantics of Concurrency, Infoand Co. 54 , 1 /2 (1982), 70–121.Google Scholar
  11. 11.
    Degano,P., and Montanari,U. A Model for Distributed Systems Based on Graph Rewriting, Note Cnet 111, Computer Science Dept., Univ. of Pisa, Pisa 1983.Google Scholar
  12. 12.
    Degano,P., and Montanari,U. Liveness Properties as Convergence in Metric Spaces, Proc. 16th Annual ACM SIGACT Symposium on Theory of Computing, April 30–May 2, 1984, Washington, DC, pp. 31–38.Google Scholar
  13. 13.
    De Nicola,R., and Hennessy,M.C.B. Testing Equivalence for Processes, Proc. 10th ICALP (J. Diaz Ed.), LNCS 154, Springer-Verlag, Berlin, 1983, pp. 548–561.Google Scholar
  14. 14.
    Dugundji,J. Topology Allyn and Bacon, 1966.Google Scholar
  15. 15.
    Ehrig,H. Aspects of Concurrency in Graph Grammars, Proc. 2nd Int. Workshop Graph-Grammars and their Application to Computer Science (H. Ehrig, M.A. Nagel, and G. Rozenberg Eds), Haus Ohrbech, Germany, 1982, LNCS, 153, Springer-Verlag, Berlin, 1983, pp. 58–81.Google Scholar
  16. 16.
    Francez,N., Hoare,C.A.R., Lehman,D.J., and De Roever,W.P., Semantics of Nondeterminism, Concurrency and Communication, J. Comp. Syst. Sciences 19 (1979), 290–308.Google Scholar
  17. 17.
    Goguen,J.A., Thatcher,J.W., Wagner,E.G., and Wright,J.B. Initial Algebra Semantics and Continuous Algebras, J.ACM 24 , 1 (1977), 68–95.MathSciNetMATHGoogle Scholar
  18. 18.
    Hoare,C.A.R., Brookes,S.D., and Roscoe,A.W. A Theory of Communicating Sequential Processes, J. ACM31, 3 (1984), 560–599.Google Scholar
  19. 19.
    Lauer,P.E., Torrigiani,P.R., and Shields,M.W., COSY: A System Specification Language Based on Paths and Processes, Acta Informatica 12 (1979), 109–158.MATHGoogle Scholar
  20. 20.
    Milner,R. Flow Graphs and Flow Algebras, J.ACM 26, 4 (1979), 794–818.MathSciNetMATHCrossRefGoogle Scholar
  21. 21.
    Milner,R., A Calculus of Communicating Systems LNCS, 92, Springer-Verlag, Berlin 1980.Google Scholar
  22. 22.
    Milner,R. Calculi for Synchrony and Asynchrony, TCS 25 (1983), 267–310.MathSciNetMATHGoogle Scholar
  23. 23.
    Montanari,U. and Simonelli,C. On Distinguishing Concurrency from Non-determinism, Réseaux de Petri et Parallélism, Colleville sur mer, 1980.Google Scholar
  24. 24.
    Nagel,M.A. Tutorial and Bibliographic Survey on Graph Grammars, Proc. Int. Workshop Graph-Grammars and their Application to Computer Science and Biology (V. Claus, H. Ehrig, and G. Rozenberg Eds), Bad Honnef, Germany, October 1978, LNCS, 73, Springer-Verlag, Berlin, 1979, pp. 70–126.Google Scholar
  25. 25.
    Nielsen,M., Plotkin,G.D. and Winskel,G. Petri nets, Event Structures and Domains, part 1, TCS 13 (1981), 85–108.Google Scholar
  26. 26.
    Nivat,M. Infinite Words, Infinite Trees, Infinite Computations, Foundations of Computer Science III, Vol. II (J.W. de Bakker and J. van Leevwen Eds), Mathematical Centre Tracts, 109, Amsterdam, 1979, pp. 1–52.Google Scholar
  27. 27.
    Nivat,M. Behaviours of Processes and Synchronized Systems of Processes, In: Theoretical Foundations of Programming Methodology(M. Broy and G. Schmidt Eds ), Reidel Dodrecht, 1982, pp. 473–550.Google Scholar
  28. 28.
    Petri,C.A. Concurrency Proc. Net Theory and Applications, LNCS, 84, Springer-Verlag, Berlin, 1980, pp. 251–260.Google Scholar
  29. 29.
    Plotkin,G.D. An Operational Semantics for CSP, Proc. IFIP TC 2-Working Conference: Formal Description of Programming Concepts II (D. BjOrner Ed.). Garmisch-Partenkirchen, June 1982, North-Holland, Amsterdam 1983, pp. 199–223.Google Scholar
  30. 30.
    Pratt,V.R. On the Composition of Processes, Proc. 9th POPL, Albuquerque, New Mexico, 1982.Google Scholar
  31. 31.
    Scott,D.S. Data Types as Lattices, SIAM J. on Comp.5 (1976), 522–587.Google Scholar
  32. 32.
    Winkowski,J. Behaviours of Concurrent Systems, TCS 12 (1980), 39–60.MathSciNetMATHGoogle Scholar
  33. 33.
    Winskel,G. Event Structure Semantics for CCS and Related Languages, Proc. 9th ICALP (M. Nielsen and E.M. Schmidt Eds), LNCS, 140, Springer-Verlag, Berlin, 1982, pp. 561–576.Google Scholar
  34. 34.
    Degano, P. and Montanari, U. Specification Languages for Modelling Concurrency, In: Parallel Integrated Technology for Image Processing (S. Levialdi Ed.), Academic Press, London, 1985.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Pierpaolo Degano
    • 1
  • Ugo Montanari
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly

Personalised recommendations