Advertisement

Semantics for Concurrency

Proceedings of the International BCS-FACS Workshop, Sponsored by Logic for IT (S.E.R.C.), 23–25 July 1990, University of Leicester, UK

  • Marta Zofia Kwiatkowska
  • Michael William Shields
  • Richard Monro Thomas
Conference proceedings

Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Eike Best, Ludmila Cherkasova, Jörg Desel, Javier Esparza
    Pages 16-20
  3. F. S. de Boer, J. N. Kok, C. Palamidessi, J. J. M. M. Rutten
    Pages 38-60
  4. Bard Bloom, Albert R. Meyer
    Pages 81-95
  5. S. L. Bloom, Z. Ésik, D. Taubner
    Pages 96-115
  6. David B. Benson, Prakash Panangaden, James R. Russell
    Pages 175-184
  7. Greg Findlow, Jonathan Billington
    Pages 185-203
  8. Joost Engelfriet, George Leih, Grzegorz Rozenberg
    Pages 204-221
  9. Nisse Husberg
    Pages 222-241
  10. J. J. M. Hooman, S. Ramesh, W. P. de Roever
    Pages 242-261
  11. Shmuel Katz, Doron Peled
    Pages 262-280
  12. Chris Tofts
    Pages 281-294
  13. David Murphy
    Pages 295-310
  14. Uri Abraham, Shai Ben-David, Menachem Magidor
    Pages 311-323
  15. David K. Probst, Hon F. Li
    Pages 324-343
  16. Back Matter
    Pages 345-346

About these proceedings

Introduction

The semantics of concurrent systems is one of the most vigorous areas of research in theoretical computer science, but suffers from disagree­ ment due to different, and often incompatible, attitudes towards abstracting non-sequential behaviour. When confronted with process algebras, which give rise to very elegant, highly abstract and com­ positional models, traditionally based on the interleaving abstraction, some argue that the wealth of contribution they have made is partially offset by the difficulty in dealing with topics such as faimess. On the other hand, the non-interleaving approaches, based on causality, although easing problems with fairness and confusion, still lack struc­ ture, compositionality, and the elegance of the interleaving counter­ parts. Since both these approaches have undoubtedly provided important contributions towards understanding of concurrent systems, one should concentrate on what they have in common, rather than the way they differ. The Intemational Workshop on Semantics for Concurrency held at the University of Leicester on 23-25 July 1990 was organised to help overcome this problem. Its main objective was not to be divisive, but rather to encourage discussions leading towards the identification of the positive objective features of the main approaches, in the hope of furthering common understanding. The Workshop met with an excel­ lent response, and attracted contributions from all over the world. The result was an interesting and varied programme, which was a combi­ nation of invited and refereed papers. The invited speakers were: Prof. dr. E. Best (Hildesheim University) Prof. dr. A.

Keywords

algorithms data structures modeling petri nets semantics

Authors and affiliations

  • Marta Zofia Kwiatkowska
    • 1
  • Michael William Shields
    • 2
  • Richard Monro Thomas
    • 1
  1. 1.Department of Computing StudiesUniversity of LeicesterLeicesterUK
  2. 2.Engineering Electronic LaboratoriesThe University CanterburyKentUK

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4471-3860-0
  • Copyright Information Springer-Verlag London 1990
  • Publisher Name Springer, London
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-19625-9
  • Online ISBN 978-1-4471-3860-0
  • Series Print ISSN 1431-1682
  • Buy this book on publisher's site