This volume provides an overview of current research work in the area of concurrency theory. It will be of interest to students and researchers in a number of related areas, including semantics of programming languages, distributed algorithms, and verification.

Klappentext

This is the latest volume in the Workshops in Computing series, and contains the papers presented at the International Workshop on Structures in Concurrency Theory (STRICT), held in Berlin, from 11 - 13 May 1995. Concurrency theory deals with formal aspects of concurrent systems. It uses partly competing and partly complementary formalisms and structures. This workshop was jointly organised by the Humboldt-Universität zu Berlin and the ESPRIT Basic Research Working Group CALIBAN. CALIBAN and its predecessor DEMON are ESPRIT Basic Research projects with the aim of developing design methodologies based on causal models such as Petri nets. The workshop marked the third year of the project, and surveyed the results of CALIBAN and DEMON since 1989.

Inhalt
The Three Dimensions of Semantics.- CALIBAN - Esprit Basic Research WG 6067.- Design of Real-Time Systems: Interface Between Duration Calculus and Program Specifications.- Conformance: A Precongruence Close to Bisimilarity.- On the Synchronic Structure of Transition Systems.- An M-Net Semantics of B(PN)2.- Graphs for Generalized Traces.- Orbits, Half-Frozen Tokens and the Liveness of Weighted Circuits.- An Observational Semantics for Linda.- Refinement and Recursion in a High Level Petri Box Caluculus.- Sequentiality by Linear Implication and Universal Quantification.- Linear Space Algorithm for On-Line Detection of Global Predicates.- A Simple Decision Method for the Linear Time Mu-Calculus.- Message Passing Mutex.- Possible and Guaranteed Concurrency in CSP.- Metric Completion Versus Ideal Completion.- Keeping Track of the Latest Gossip in Message-Passing Systems.- A Local Presentation of Synchronizing Systems.- On Well-Formedness Analysis: The Case of Deterministic Systems of Sequential Processes.- An Event-Based SOS for a Language with Refinement.- On the Computation of Place Invariants for Algebraic Petri Nets.- Failure-Based Equivalences Are Faster Than Many Believe.- Partial Order Semantics and Weak Fairness.- Author Index.