Semantics of systems of concurrent processes : LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, proceedings
Author(s)
Bibliographic Information
Semantics of systems of concurrent processes : LITP Spring School on Theoretical Computer Science, La Roche Posay, France, April 23-27, 1990, proceedings
（Lecture notes in computer science, 469）
Springer-Verlag, c1990
- : gw
- : us
Available at / 56 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||46990093787
-
University of Tsukuba Library, Library on Library and Information Science
: gw007.08:L-49:469901016700
-
No Libraries matched.
- Remove all filters.
Note
"The School was organized jointly by the LITP (Laboratoire d'informatique théorique et programmation, Paris) and IRIT (Institut pour la recherche en informatique de Toulouse)"--Foreword
Includes bibliographical references
Description and Table of Contents
Description
This volume contains the proceedings of the 1990 Spring School of Theoretical Computer Science, devoted to the semantics of concurrency. The papers are of two kinds: - surveys and tutorials introducing the subject to novices and students and giving updates of the state of the art, - research papers presenting recent achievements in the semantics of concurrency. The contributions explicate the connections, similarities and differences between various approaches to the semantics of concurrency, such as pomsets and metric semantics, event structures, synchronization trees, fixpoints and languages, traces, CCS and Petri nets, and categorical models. They also cover and compare the various notions of observation and bisimulation equivalences, logics for concurrency, and applications to dis- tributed systems.
Table of Contents
Processes as data types: Observational semantics and logic.- Metric pomset semantics for a concurrent language with recursion.- Fault-tolerant naming and mutual exclusion.- Flow event structures and flow nets.- Three equivalent semantics for CCS.- Towards a semantic approach to SIMD architectures and their languages.- Concerning the size of clocks.- Transition systems with algebraic structure as models of computations.- Concurrency and computability.- Causal trees interleaving + causality.- Partially commutative formal power series.- Infinite traces.- Equivalences and refinement.- CCS and petri nets.- About fixpoints for concurrency.- Observers, experiments, and agents: A comprehensive approach to parallelism.- Action versus state based logics for transition systems.- Approaching fair computations by ultra metrics.- On distributed languages and models for distributed computation.
by "Nielsen BookData"