CEDISYS compositional distributed systems state of the art, research goals, references

  • Ugo Montanari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 424)


The Basic Research Action No 3011 CEDISYS is funded in the Area of Computer Science, under the ESPRIT Programme of the European Communities. The coordinating institution is the Computer Science Department, University of Pisa, Italy, and the participating institutions are the Computer Science Department, Aarhus University, Denmark, the INRIA Sophia-Antipolis, France, and the Computer Science Department, Sussex University, England. This document contains some parts of the original proposal, submitted in June, 1988. Both the summary of the state of the art and the list of references are manifestly incomplete with respect to the work of others. However, we feel that this document might be of interest to a wider audience in the area of concurrency.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

7. Bibliography

  1. [1]
    Samson Abramski, Domain Theory in Logical Form, LICS '87.Google Scholar
  2. [2]
    Luca Aceto, Rocco De Nicola and Alessandro Fantechi, A Testing Equivalence For Event Structures, in Mathematical Models for the Semantics of Parallelism, Springer LNCS 280, 1987, 1–20.Google Scholar
  3. [3]
    Howard Barringer, Using Temporal Logic In The Compositional Specification of Concurrent Systems, Tech. Rep. UMCS-86-10-1, October 1986, Dept. of Computer Science, Univ. of Manchester.Google Scholar
  4. [4]
    Gerard Boudol and Ilaria Castellani, Concurrency and Atomicity, 1987, Theoretical Computer Science 59, 1–2, 1988, pp. 25–84.Google Scholar
  5. [5]
    Boudol, G. and Castellani, I. Permutations of Transitions: An Event Structure Semantics for CCS and SCCS, LNCS 354, Springer, pp. 411–427.Google Scholar
  6. [6]
    M. C. Browne, E. M. Clarke and O. Grumberg, Characterizing Finite Kripke Structures in Propositional Temporal Logic, TCS.Vol.59, No,2, July 1988, pp. 115–132Google Scholar
  7. [7]
    Manfred Broy, Process Semantics of Communicating Concurrent Programs, Tech. Rep. MIP-8602, Univ. Passau, Feb. 1986.Google Scholar
  8. [8]
    Ilaria Castellani, Bisimulation and Abstraction Homomorphisms, Journal of Computer and System Sciences, April/June 1987, vol. 34, No.2/3.Google Scholar
  9. [9]
    Ilaria Castellani and Mattew Hennessy, Distributed Bisimulations, Research Report 5/87, Computer Science Department, University of Sussex, July 1987. Also JACM, to appear.Google Scholar
  10. [10]
    E. M. Clarke, E. A. Emerson and A. P. Sistla, Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications, ACM Transactions on Programming Languages and Systems 8, 2(1986), 244–263.Google Scholar
  11. [11]
    Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, Observational Equivalences for Concurrency Models, Proc. IFIP TC2 Workshop on Formal Description of Programming Concepts IV, North-Holland, 1987, M. Wirsing, Ed., 105–132Google Scholar
  12. [12]
    Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, A Distributed Operational Semantics For CCS Based On Condition/Event Systems, Acta Informatica 26, pp.59–91 (1988).Google Scholar
  13. [13]
    Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, On the Consistency of “Truly Concurrent” Operational and Denotational Semantics, Proc. 3rd Symp. on Logic in Computer Science, IEEE 1988, pp.133–141.Google Scholar
  14. [14]
    Pierpaolo Degano, Rocco De Nicola and Ugo Montanari, A partial Ordering Semantics For CCS. Technical Report, Dipartimento di Informatica di Pisa, TR-3/88. Also TCS, to appear.Google Scholar
  15. [15]
    Pierpaolo Degano, Roberto Gorrieri and Sergio Marchetti, An Exercise in Concurrency: A CSP Process as a Condition/Event System, in G. Rozenberg, Ed., Advances in Petri Net 1988, LNCS 340, Springer, pp.85–105.Google Scholar
  16. [16]
    Pierpaolo Degano and Ugo Montanari, Specification Languages For Distributed Systems, Tapsoft 1985, H. Ehrig et al., Eds., 29–51, Springer LNCS 185.Google Scholar
  17. [17]
    Pierpaolo Degano and Ugo Montanari, A Model For Distributed Systems Based On Graph Rewriting, Journal of the Association for Computing Machinery, Vol. 34, No. 2, April 1987, 411–449.Google Scholar
  18. [18]
    Pierpaolo Degano and Ugo Montanari, Concurrent Histories: A Basis for Observing Distributed Systems, Journal of Computer and System Sciences, April/June 1987, vol. 34, No.2/3, 422–461.Google Scholar
  19. [19]
    Diers, Y., Catégories Localisables, Thése de Doctorat d'Etat, Université Paris 6, 1977.Google Scholar
  20. [20]
    Michael P. Georgeff and Amy L. Lansky, Eds., Proc. 1986 Workshop on Reasoning about Actions and Plans, Morgan Kaufmann, 1987.Google Scholar
  21. [21]
    Goltz, U. and Reisig, W. The Non-sequential Behaviour of Petri Nets, Info. and Co. 57, 125–147 (1983).Google Scholar
  22. [22]
    Roberto Gorrieri, Sergio Marchetti and Ugo Montanari, A2CCS: A Simple Extension Of CCS For Handling Atomic Actions, Proc. CAAP 1988, Springer LNCS 299, pp. 258–270.Google Scholar
  23. [23]
    Matthew Hennessy and Robin Milner, Algebraic Laws for Nondeterminism and Concurrency, Journal of ACM, 32 (1985), pp. 137–161.Google Scholar
  24. [24]
    Shmuel Katz and Doron Peled, Interleaving Set Temporal Logic, 1987, submitted for publication. A preliminary version is in PODC '87.Google Scholar
  25. [25]
    Johnstone, P., A Syntactic Approach to Diers' Localizable Categories, Proc. Durham Conference on Applications of Sheaves 1977, Spriger Lecture Notes in Mathematics 153, 1979.Google Scholar
  26. [26]
    K. Lodaya and P. S. Thiagarajan, A Modal Logic For A Subclass Of Event Structures, 1987. A preliminary version is in ICALP '87.Google Scholar
  27. [27]
    Mazurkiewicz, A., Concurrent Program Schemas and Their Interpretation, Proc. Aarhus Workshop on Verification of Parallel Programs, 1977.Google Scholar
  28. [28]
    José Meseguer and Ugo Montanari, Petri Nets are Monoids: A New Algebraic Foundations for Net Theory, Proc. 3rd Symp. on Logic in Computer Science, IEEE 1988, pp. 155–164.Google Scholar
  29. [29]
    Ugo Montanari and Marcello Sgamma, On A Standard Representation Of Nondeterministic Behaviour, Proc. Colloquium On The Resolution Of Equations In Algebraic Structures, Lakeway, Texas, May 4–6, 1987, North-Holland, to appear.Google Scholar
  30. [30]
    Nielsen, M., Plotkin, G. and Winskel, G., Petri Nets, Event Structures and Domains, TCS 13 (1981), pp. 85–108. [26] Ernst-Rudiger Olderog, Operational Petri Net Semantics For CCSP, Advances in Petri Nets 1987, G. Rozenberg, Ed., 196–223, Springer LNCS 266.Google Scholar
  31. [31]
    Ernst-Rudiger Olderog, Operational Petri Net Semantics For CCSP, Advances in Petri Nets 1987, G. Rozenberg, Ed., 196–223, Springer LNCS 266.Google Scholar
  32. [32]
    Shlomit S. Pinter and Pierre Wolper, A Temporal Logic For Reasoning About Partially Ordered Computations, Proc Third Symp. on Principles of Distributed Computing, Vancouver, August 27–29, 1984, 28–37.Google Scholar
  33. [33]
    Gordon Plotkin, A Structural Approach to Operational Semantics, Technical Report DAIMI FN-19, Aarhus University, (Department of Computer Science, Aarhus, 1981).Google Scholar
  34. [34]
    Vaughn Pratt, Modelling Concurrency with Partial Orders, International Journal of Parallel Programming, 15, (1986) pp. 33–71.Google Scholar
  35. [35]
    Reisig, W. Towards a Temporal Logic for True Concurrency. Part I: Linear Time Propositional Logic. Arbeitspapiere der GMD 277, 1987.Google Scholar
  36. [36]
    Yohav Shoham, What is the Frame Problem?, in [1], pp. 83–99.Google Scholar
  37. [37]
    Stark, E. W., Concurrent Transition Systems, Tech. Rep., SUNY at Stony Brook, Computer Science Dept, June 1987.Google Scholar
  38. [38]
    Colin Stirling, A Proof-Theoretic characterization of Observational Equivalence, Theoretical Computer Science 39 (1985) 27–45.Google Scholar
  39. [39]
    Colin Stirling, Modal Logics for Communicating Systems, Theoretical Computer Science 49 (1987) 311–347.Google Scholar
  40. [40]
    Rob van Glabbeek and Frits Vaandrager, Petri Net Models For Algebraic Theories Of Concurrency, PARLE Conference 1987, J. W. de Bakker et al., Eds., Springer LNCS 259.Google Scholar
  41. [41]
    Moshe Y. Vardi, Verification of Concurrent Programs: The Automata-Theoretic Framework, Proc. Symp. on Logics in Computer Science, Ithaca, June 22–25, 1987, 167–176.Google Scholar
  42. [42]
    Glynn Winskel, Event structures, University of Cambridge Computer Laboratory, July 1986, Technical Report No.95. Also in Advances in Petri Nets 1986, LNCS 255, Springer, pp.325–392.Google Scholar
  43. [43]
    Glynn Winskel, Lectures on Models and Logic of MOS Circuits. Four invited lectures for the Marktoberdorf Summer School, July 1986. Published in the Springer NATO ASI Series, 1987.Google Scholar
  44. [44]
    Glynn Winskel, Petri Nets, Algebras, Morphisms and Compositionality, Info and Co., 1987, vol.72, 197–238.Google Scholar
  45. [45]
    Glynn Winskel, A Category of Labelled Petri Nets and Compositional Proof Systems, Proc. 3rd Symp. on Logic in Computer Science, IEEE 1988.Google Scholar
  46. [46]
    Zhang, Q., On Semantics-Directed Logic, PhD Thesis, University of Cambridge, in preparation, to be completed in 1989.Google Scholar

Copyright information

© Springer-Verlag 1990

Authors and Affiliations

  • Ugo Montanari
    • 1
  1. 1.Dipartimento di InformaticaUniversità di PisaPisaItaly

Personalised recommendations