Semantics for Concurrency

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.

Contenu

A General Tableau Technique for Verifying Temporal Properties of Concurrent Programs (Extended Abstract).- Traps, Free Choice and Home States (Extended Abstract).- A Denotational Semantics for Synchronous and Asynchronous Behavior with Multiform Time (Extended Abstract).- From Failure to Success: Comparing a Denotational and a Declarative Semantics for Horn Clause Logic.- Negations of Transactions and Their Use in the Specification of Dynamic and Deontic Integrity Constraints.- Experimenting with Process Equivalence.- Iteration Theories of Synchronization Trees.- Towards a Theory of Parallel Algorithms on Concrete Data Structures.- Causal Automata I: Confluence ? (AND, OR) Causality.- A Simple Generalization of Kahn's Principle to Indeterminate Dataflow Networks (Extended Abstract).- Defining Fair Merge as a Colimit: Towards a Fixed-Point Theory for Indeterminate Dataflow.- High-Level Nets for Dynamic Dining Philosophers Systems.- Formalizing the Behaviour of Parallel Object-Based Systems by Petri Nets.- High Level Distributed Transition Systems.- A Compositional Axiomatisation of Safety and Liveness Properties for Statecharts.- Defining Conditional Independence Using Collapses.- Timed Concurrent Processes.- Approaching a Real-Timed Concurrency Theory.- On Global-Time and Inter-Process Communication.- Modelling Reactive Hardware Processes Using Partial Orders.- Author Index.