Models for Concurrency
Autor Uri Abrahamen Limba Engleză Hardback – 24 mai 1999
The book is divided into three main sections. The first introduces the required concepts from model theory, details the structures that are used to model concurrency, gives an in-depth description and explanation of the semantics of a simple language that allows concurrent execution of sequential programs, and deals with the question of resolving executions into higher-level and lower-level granularities. The second and third sections apply the theory developed to practical examples, and an exposition of the producer/consumer problem with details of two solutions is given. The author also deals with message passing, as opposed to shared memory.
Preț: 785.93 lei
Preț vechi: 958.44 lei
-18% Nou
Puncte Express: 1179
Preț estimativ în valută:
150.40€ • 156.07$ • 125.71£
150.40€ • 156.07$ • 125.71£
Carte tipărită la comandă
Livrare economică 17-31 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9789056991999
ISBN-10: 905699199X
Pagini: 248
Ilustrații: illustrations
Dimensiuni: 156 x 234 x 19 mm
Greutate: 0.55 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
ISBN-10: 905699199X
Pagini: 248
Ilustrații: illustrations
Dimensiuni: 156 x 234 x 19 mm
Greutate: 0.55 kg
Ediția:1
Editura: CRC Press
Colecția CRC Press
Public țintă
ProfessionalCuprins
PART I 1. System Executions 2. Semantics of Concurrent Protocols
PART II 1. On the Producer/Consumer Problem 2. Circular Buffers
PART III 1.Specification of Channels 2. A Sliding Window Protocol 3. Elements of Model Theory 4. Broadcasting and Causal Ordering 5. Uniform Deliveries
PART II 1. On the Producer/Consumer Problem 2. Circular Buffers
PART III 1.Specification of Channels 2. A Sliding Window Protocol 3. Elements of Model Theory 4. Broadcasting and Causal Ordering 5. Uniform Deliveries
Descriere
Models for Concurrency presents a comprehensive analysis of model theory applied to concurrent protocols, and seeks to provide a theory of concurrency that is both intuitively appealing and rigorously based on mathematical foundations.