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))

"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."--PUBLISHER'S WEBSITE. Processes as data types: Observational semantics and logic....Pages 1-20 Metric pomset semantics for a concurrent language with recursion....Pages 21-49 Fault-tolerant naming and mutual exclusion....Pages 50-61 Flow event structures and flow nets....Pages 62-95 Three equivalent semantics for CCS....Pages 96-141 Towards a semantic approach to SIMD architectures and their languages....Pages 142-175 Concerning the size of clocks....Pages 176-184 Transition systems with algebraic structure as models of computations....Pages 185-222 Concurrency and computability....Pages 223-238 Causal trees interleaving + causality....Pages 239-255 Partially commutative formal power series....Pages 256-276 Infinite traces....Pages 277-308 Equivalences and refinement....Pages 309-333 CCS and petri nets....Pages 334-357 About fixpoints for concurrency....Pages 358-374 Observers, experiments, and agents: A comprehensive approach to parallelism....Pages 375-406 Action versus state based logics for transition systems....Pages 407-419 Approaching fair computations by ultra metrics....Pages 420-433 On distributed languages and models for distributed computation....Pages 434-456