A classification of models for concurrency

  • Vladimiro Sassone
  • Mogens Nielsen
  • Glynn Winskel
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 715)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. A. Bednarczyk. Categories of Asynchronous Transition Systems. PhD Thesis, University of Sussex, 1988.Google Scholar
  2. [2]
    M. Hennessy. Algebraic Theory of Processes. Cambridge, Massachusetts, 1988.Google Scholar
  3. [3]
    C.A.R. Hoare. Communicating Sequential Processes. Englewood Cliffs, 1985.Google Scholar
  4. [4]
    R.M. Keller. Formal Verification of Parallel Programs. Communications of the ACM, n. 19, vol. 7, pp. 371–384, 1976.Google Scholar
  5. [5]
    A. Mazurkiewicz. Basic Notions of Trace Theory. In lecture notes for the REX summerschool in temporal logic, LNCS n. 354, pp. 285–363, Springer-Verlag, 1988.Google Scholar
  6. [6]
    R. Milner. Communication and Concurrency. Englewood Cliffs, 1989.Google Scholar
  7. [7]
    M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, Event Structures and Domains, part 1. Theoretical Computer Science, n. 13, pp. 85–108, 1981.CrossRefGoogle Scholar
  8. [8]
    C.A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn, FRG, 1962.Google Scholar
  9. [9]
    G. Plotkin. A Structural Approach to Operational Semantics. Technical report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.Google Scholar
  10. [10]
    V. Sassone, M. Nielsen, and G. Winskel. A Classification of Models for Concurrency. To appear as Technical Report DAIMI, Computer Science Department, Aarhus University, 1993.Google Scholar
  11. [11]
    V. Sassone, M. Nielsen, and G. Winskel. Deterministic Behavioural Models for Concurrency. To appear as Technical Report DAIMI, Computer Science Department, Aarhus University, 1993. Extended abstract to appear in Proceedings of MFCS '93.Google Scholar
  12. [12]
    M.W. Shields. Concurrent Machines. Computer Journal, n. 28, pp. 449–465, 1985.CrossRefGoogle Scholar
  13. [13]
    A. Stark. Concurrent Transition Systems. Theoretical Computer Science, n. 64, pp. 221–269, 1989.CrossRefGoogle Scholar
  14. [14]
    G. Winskel. Event Structure Semantics of CCS and Related Languages. In proceedings of ICALP '82, LNCS n. 140, pp. 561–567, Springer-Verlag, 1982. Expanded version available as technical report DAIMI PB-159, Computer Science Department, Aarhus University.Google Scholar
  15. [15]
    G. Winskel. Synchronization Trees. Theoretical Computer Science, n. 34, pp. 33–82, 1985.Google Scholar
  16. [16]
    G. Winskel. Event Structures. In Advances in Petri nets, LNCS n. 255, pp. 325–392, Springer-Verlag, 1987.Google Scholar
  17. [17]
    G. Winskel, and M. Nielsen. Models for Concurrency. To appear in the Handbook of Logic in Computer Science. A draft appears as technical report DAIMI PB-429, Computer Science Department, Aarhus University, 1992.Google Scholar

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Vladimiro Sassone
    • 1
  • Mogens Nielsen
    • 2
  • Glynn Winskel
    • 2
  1. 1.Dipartimento di InformaticaUniversità di PisaItaly
  2. 2.Computer Science DepartmentAarhus UniversityDenmark

Personalised recommendations