Semantics of systems of concurrent processes. LITP Spring School on theoretical computer science, La Roche Posay, France, 23-27 April 1990. Proceedings (Q1188804)

[The articles of this volume will not be indexed individually.] This volume includes a group of selected papers of the proceedings of the ``\textit{LITP Spring School on theoretical computer science, 1990}''. It contains, with few exceptions, only advanced talks. Tutorial talks are not included, but a list of them can be found in the ``Foreword'' page of the book. The book represents a state of the art in Semantics of Concurrency. It offers a valuable survey of the recent achievements in this area, also new results and ideas. Although the volume is not organized in parts or sections the editor proposes a classification of included papers. According to this classification the volume covers four main themes: {1. } Models for concurrent and distributed systems. More than ten papers are concerning with topics as: CCS, Petri nets, event structures, pomsets and metric semantics, causal trees, fixpoints, infinite traces, categorical models. Synthesis of various models of parallelism and unifying approaches for the semantics of concurrency seems to be the most actual trends. {2. } Observation and bisimulation equivalences. This area is covered by several papers on observational semantics, processes as data types, equivalences and refinements. {3. } Logics for concurrency. This part includes papers on bisimulation logics, computability and concurrency. {4. } Applications to distributed systems. The volume includes papers dealing with parallel languages for SIMD model, problems of distributed systems, clocks. All included papers are in extended form with complete definitions, proofs and references. Contents: \textit{E. Astesiano}, \textit{A. Giovini}, \textit{G. Reggio}, Processes as Data Types: Observational Semantics and Logic (1-20); \textit{J. W. de Bakker}, \textit{J. H. A. Warmerdam}, Metric Pomset Semantics for a Concurrent Language with Recursion (21-49); \textit{J. Beauquier}, Fault-Tolerant Naming and Mutual Exclusion (50-61); \textit{G. Boudol}, Flow Event Structures and Flow Nets (62-95); \textit{G. Boudol}, \textit{I. Castellani}, Three Equivalent Semantics for CCS (96-141); \textit{L. Bougé}, \textit{P. Garda}, Towards a Semantic Approach to SIMD Architectures and their Languages (142-175); \textit{B. Charron-Bost}, Concerning the Size of Clocks (176-184); \textit{A. Corradini}, \textit{G. L. Ferrari}, \textit{U. Montanari}, Transition Systems with Algebraic Strucure as Models of Computations (185-222); \textit{Ph. Darondeau}, Concurrency and Computability (223-238); \textit{Ph. Darondeau}, \textit{P. Degano}, Causal Trees: Interleaving + Causality (239-255); \textit{G. Duchamp}, \textit{D. Krob}, Partially Commutative Formal Power Series (256-276); \textit{P. Gastin}, Infinite Traces (277-308); \textit{R. J. van Glabbeek}, \textit{U. Goltz}, Equivalences and Refinement (309-333); \textit{U. Goltz}, CCS and Petri Nets (334-357); \textit{I. Guessarian}, About Fixpoints for Concurrency (358-374); \textit{S. Kasangian}, \textit{A. Labella}, \textit{A. Pettorossi}, Observers, Experiments and Agents: a Comprehensive Approach to Parallelism (375-406); \textit{R. De Nicola}, \textit{F. Vaandrager}, Action versus State based Logics for Transition Systems (407-419); \textit{L. Priese} Approaching Fair Computations by Ultra Metrics (420-433); \textit{B. Rozoy}, On Distributed Languages and Models for Distributed Computation (434-456).