Cantitate/Preț
Produs

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, cartea 469

Editat de Irene Guessarian
en Limba Engleză Paperback – 28 noi 1990
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 34410 lei

Preț vechi: 43012 lei
-20% Nou

Puncte Express: 516

Preț estimativ în valută:
6584 6874$ 5449£

Carte tipărită la comandă

Livrare economică 04-18 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540534792
ISBN-10: 3540534792
Pagini: 468
Ilustrații: V, 457 p. 6 illus.
Dimensiuni: 170 x 244 x 25 mm
Greutate: 0.74 kg
Ediția:1990
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.