Advertisement

Relationships between models of concurrency

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

Abstract

Models for concurrency can be classified with respect to the three relevant parameters: behaviour/system, interleaving/noninterleaving, linear/branching time. When modelling a process, a choice concerning such parameters corresponds to choosing the level of abstraction of the resulting semantics. The classifications are formalized through the medium of category theory.

Keywords

Semantics Concurrency Models for Concurrency Categories 

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]
    J. Gischer. The Equational Theory of Pomsets. Theoretical Computer Science, n. 61, pp. 199–224, 1988.Google Scholar
  3. [3]
    J. Grabowski. On Partial Languages. Fundamenta Informaticae, n. 4, pp. 428–498, 1981.Google Scholar
  4. [4]
    M. Hennessy. Algebraic Theory of Processes. Cambridge, Massachusetts, 1988.Google Scholar
  5. [5]
    C.A.R. Hoare. Communicating Sequential Processes. Englewood Cliffs, 1985.Google Scholar
  6. [6]
    P.W. Hoogers, H.C.M. Kleijn, and P.S. Thiagarajan. A Trace Semantics for Petri Nets. In Proceedings of ICALP '92, LNCS, n. 623, pp. 595–604, Springer Verlag, 1992.Google Scholar
  7. [7]
    R.M. Keller. Formal Verification of Parallel Programs. Communications of the ACM, n. 19, vol. 7, pp. 371–384, 1976.Google Scholar
  8. [8]
    S. MacLane. Categories for the Working Mathematician. GTM, Springer-Verlag, 1971.Google Scholar
  9. [9]
    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
  10. [10]
    R. Milner. Communication and Concurrency. Englewood Cliffs, 1989.Google Scholar
  11. [11]
    M. Nielsen, G. Plotkin, and G. Winskel. Petri nets, Event Structures and Domains, part 1. Theoretical Computer Science, n. 13, pp. 85–108, 1981.Google Scholar
  12. [12]
    C.A. Petri. Kommunikation mit Automaten. PhD thesis, Institut für Instrumentelle Mathematik, Bonn, FRG, 1962.Google Scholar
  13. [13]
    G. Plotkin. A Structural Approach to Operational Semantics. Technical report DAIMI FN-19, Computer Science Department, Aarhus University, 1981.Google Scholar
  14. [14]
    V. Pratt. Modeling Concurrency with Partial Orders. International Journal of Parallel Processing, n. 15, pp. 33–71, 1986.Google Scholar
  15. [15]
    V. Sassone, M. Nielsen, and G. Winskel. A Classification of Models for Concurrency. In Proceedings of Fourth International Conference on Concurrency Theory, CONCUR '93, LNCS n. 715, pp. 82–96, Springer-Verlag, 1993.Google Scholar
  16. [16]
    V. Sassone, M. Nielsen, and G. Winskel. Deterministic Behavioural Models for Concurrency. In Proceedings of 18th International Symposium on the Mathematical Foundations of Computer Science, MFCS '93, LNCS n. 711, pp. 682–692, Springer-Verlag, 1993.Google Scholar
  17. [17]
    M.W. Shields. Concurrent Machines. Computer Journal, n. 28, pp. 449–465, 1985.Google Scholar
  18. [18]
    A. Stark. Concurrent Transition Systems. Theoretical Computer Science, n. 64, pp. 221–269, 1989.Google Scholar
  19. [19]
    P. Starke. Traces and Semiwords. LNCS, n. 208, pp. 332–349, Springer-Verlag, 1985.Google Scholar
  20. [20]
    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
  21. [21]
    G. Winskel. Synchronization Trees. Theoretical Computer Science, n. 34, pp. 33–82, 1985.Google Scholar
  22. [22]
    G. Winskel. Event Structures. In Advances in Petri nets, LNCS n. 255, pp. 325–392, Springer-Verlag, 1987.Google Scholar
  23. [23]
    G. Winskel, and M. Nielsen. Models for Concurrency. To appear in the Handbook of Logic in Computer Science, eds. S. Abramsky, D. Gabbay, Oxford University Press, to appear.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

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

Personalised recommendations