A01=Uri Abraham
Ack Event
Author_Uri Abraham
Buffer Cell
Category=PBCD
Category=UK
communication protocols
Concurrent Protocol
concurrent systems
consumer problem
CS Event
Dequeue Operation
distributed computing
eq_bestseller
eq_computing
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
eq_non-fiction
event-based concurrency theory
External Operations
External Semantics
formal verification
Higher Level Event
higher-level and lower-level granularities
Initial Segment
Initial Write
Internal Semantics
Lower Level Events
mathematical semantics
Natural Numbers
Operation Executions
producer
producer/consumer problem
producerconsumer problem
Protocol Language
Receive Events
Receive Operation
Send Events
sequential programs
Sliding Window Protocol
Successful Read
synchronisation algorithms
System Execution
temporal logic
Unload Event
Unreachable State
Vice Versa
Write Events
Product details
- ISBN 9789056991999
- Weight: 620g
- Dimensions: 156 x 234mm
- Publication Date: 24 May 1999
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
Secure
checkout
Fast Shipping
Easy returns
Concurrent systems are generally understood in terms of behavioral notions. Models for Concurrency analyzes the subject in terms of events and their temporal relationship rather than on global states. It 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.
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.
