Concurrency: State Models and Java Programs - page 1
- Table of Contents
- Table of Contents
- Back Cover
- ConcurrencyState Models Java Programs, 2nd Edition
- Preface
- Intended Readership
- Additional Resources
- Second Edition
- Chapter 1: Introduction
- 1.2 The Modeling Approach
- 1.3 Practice
- 1.4 Content Overview
- Summary
- Notes and Further Reading
- Chapter 2: Processes and Threads
- 2.2 Implementing Processes
- Summary
- Notes and Further Reading
- Exercises
- Chapter 3: Concurrent Execution
- 3.1 Modeling Concurrency
- 3.2 Multi-Threaded Programs
- Summary
- Notes and Further Reading
- Exercises
- Chapter 4: Shared Objects and Mutual Exclusion
- 4.2 Mutual Exclusion in Java
- 4.3 Modeling Mutual Exclusion
- Summary
- Notes and Further Reading
- Exercises
- Chapter 5: Monitors and Condition Synchronization
- 5.2 Semaphores
- 5.3 Bounded Buffers
- 5.4 Nested Monitors
- 5.5 Monitor Invariants
- Summary
- Notes and Further Reading
- Exercises
- Chapter 6: Deadlock
- 6.1 Deadlock Analysis
- 6.2 Dining Philosophers Problem
- Summary
- Notes and Further Reading
- Exercises
- Chapter 7: Safety and Liveness Properties
- 7.1 Safety
- 7.2 Single-Lane Bridge Problem
- 7.3 Liveness
- 7.4 Liveness of the Single-Lane Bridge
- 7.5 ReadersWriters Problem
- Summary
- Notes and Further Reading
- Exercises
- Chapter 8: Model-Based Design
- 8.1 From Requirements to Models
- 8.2 From Models to Implementations
- Summary
- Notes and Further Reading
- Exercises
- Chapter 9: Dynamic Systems
- 9.1 Golf Club Program
- 9.2 Golf Club Model
- 9.3 Fair Allocation
- 9.4 Revised Golf Ball Allocator
- 9.5 Bounded Overtaking
- 9.6 Bounded Overtaking Golf Ball Allocator
- 9.7 MasterSlave Program
- 9.8 MasterSlave Model
- Summary
- Notes and Further Reading
- Exercises
- Chapter 10: Message Passing
- 10.2 Asynchronous Message Passing
- 10.3 Rendezvous
- Summary
- Notes and Further Reading
- Exercises
- Chapter 11: Concurrent Architectures
- 11.2 Supervisor Worker
