Concurrency: State Models and Java Programs by Jeff Magee (English) Hardcover Bo

Description: FREE SHIPPING UK WIDE Concurrency by Jeff Magee, Jeff Kramer Concurrency provides a thoroughly updated approach to the basic concepts and techniques behind concurrent programming. Concurrent programming is complex and demands a much more formal approach than sequential programming. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher Description Concurrency provides a thoroughly updated approach to the basic concepts and techniques behind concurrent programming. Concurrent programming is complex and demands a much more formal approach than sequential programming. In order to develop a thorough understanding of the topic Magee and Kramer present concepts, techniques and problems through a variety of forms: informal descriptions, illustrative examples, abstract models and concrete Java examples. These combine to provide problem patterns and associated solution techniques which enable students to recognize the problems and arrive at solutions. Back Cover I love this book! It is beautifully written and the combined FSP/Java approach to model-based development is leading-edge. The supporting materials, including the LTSA software and the lecture slides, are superb. ( Scott Smolka, SUNY at Stony Brook) This book provides a systematic and practical approach to designing, analyzing and implementing concurrent programs, using both state models and Java programs to introduce and illustrate key concepts and techniques. Topics covered include: threads and interaction interference, exclusion and synchronization deadlock, safety and liveness properties message passing concurrent software architectures dynamic and timed systems. Established as a key learning resource for computer science graduate and undergraduate students, this second edition includes new coverage of Program Verification and Logical Properties. The accompanying website contains an updated version of the LTSA tool for modeling concurrency, model animation and model checking. The website also includes the full set of state models, Java examples and demonstration programs and a comprehensive series of overhead slides for course presentation. Ideal for classroom use or self-study, this book provides readers with the means to understand the fundamentals and practice of concurrency. Flap I love this book! It is beautifully written and the combined FSP/Java approach to model-based development is leading-edge. The supporting materials, including the LTSA software and the lecture slides, are superb. ( Scott Smolka, SUNY at Stony Brook) This book provides a systematic and practical approach to designing, analyzing and implementing concurrent programs, using both state models and Java programs to introduce and illustrate key concepts and techniques. Topics covered include: threads and interaction interference, exclusion and synchronization deadlock, safety and liveness properties message passing concurrent software architectures dynamic and timed systems. Established as a key learning resource for computer science graduate and undergraduate students, this second edition includes new coverage of Program Verification and Logical Properties. The accompanying website contains an updated version of the LTSA tool for modeling concurrency, model animation and model checking. The website also includes the full set of state models, Java examples and demonstration programs and a comprehensive series of overhead slides for course presentation. Ideal for classroom use or self-study, this book provides readers with the means to understand the fundamentals and practice of concurrency. Author Biography Jeff Magee and Jeff Kramer are both of Imperial College of Science, Technology and Medicine, London, UK Table of Contents Preface. Acknowledgments. 1. Introduction. 1.1 Concurrent Programs. 1.2 The Modeling Approach. 1.3 Practice. 1.4 Content Overview. Summary. Notes and Further Reading. 2. Processes and Threads. 2.1 Modeling Processes. 2.2 Implementing Processes. Summary. Notes and Further Reading. Exercises. 3. Concurrent Execution. 3.1 Modeling Concurrency. 3.2 Multi-Threaded Programs. Summary. Notes and Further Reading. Exercises. 4. Shared Objects and Mutual Exclusion. 4.1 Interference. 4.2 Mutual Exclusion in Java. 4.3 Modeling Mutual Exclusion. Summary. Notes and Further Reading. Exercises. 5. Monitors and Condition Synchronization. 5.1 Condition Synchronization. 5.2 Semaphores. 5.3 Bounded Buffers. 5.4 Nested Monitors. 5.5 Monitor Invariants. Summary. Notes and Further Reading. Exercises. 6. Deadlock. 6.1 Deadlock Analysis. 6.2 Dining Philosophers Problem. Summary. Notes and Further Reading. Exercises. 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 Readers–Writers Problem. Summary. Notes and Further Reading. Exercises. 8. Model-Based Design. 8.1 From Requirements to Models. 8.2 From Models to Implementation. Summary. Notes and Further Reading Exercises. 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 Master–Slave Program. 9.8 Master–Slave Model. Summary. Notes and Further Reading. Exercises. 10. Message Passing. 10.1 Synchronous Message Passing. 10.2 Asynchronous Message Passing. 10.3 Rendezvous. Summary. Notes and Further Reading. Exercises. 11. Concurrent Architectures. 11.1 Filter Pipeline. 11.2 Supervisor–Worker. 11.3 Announcer–Listener. Summary. Notes and Further Reading. Exercises. 12. Timed Systems. 12.1 Modeling Timed Systems. 12.2 Implementing Timed Systems. 12.3 Parcel Router Problem. 12.4 Space Invaders. Summary. Notes and Further Reading. Exercises. 13.ihl Program Verification. 13.1 Sequential Processes. 13.2 Modeling Condition Synchronization. 13.3 Modeling Variables and Synchronized Methods. 13.4 Bounded Buffer Example. 13.5 Readers–Writers Example. Summary. Notes and Further Reading. Exercises. 14. Logical Properties. 14.1 Fluent Propositions. 14.2 Temporal Propositions. 14.3 Fluent Linear Temporal Logic (FLTL). 14.4 Database Ring Problem. Summary. Notes and Further Reading. Exercises. Appendix A: FSP Quick Reference. Appendix B: FSP Language Specification. Appendix C: FSP Semantics. Appendix D: UML Class Diagrams. Bibliography. Index. Review ..."this well written book [...] will be useful to those designing distributed systems" --Computing Reviews, June 2000 Long Description I love this book! It is beautifully written and the combined FSP/Java approach to model-based development is leading-edge. The supporting materials, including the LTSA software and the lecture slides, are superb. ( Scott Smolka, SUNY at Stony Brook) This book provides a systematic and practical approach to designing, analyzing and implementing concurrent programs, using both state models and Java programs to introduce and illustrate key concepts and techniques. Topics covered include: threads and interaction interference, exclusion and synchronization deadlock, safety and liveness properties message passing concurrent software architectures dynamic and timed systems. Established as a key learning resource for computer science graduate and undergraduate students, this second edition includes new coverage of Program Verification and Logical Properties. The accompanying website contains an updated version of the LTSA tool for modeling concurrency, model animation and model checking. The website also includes the full set of state models, Java examples and demonstration programs and a comprehensive series of overhead slides for course presentation. Ideal for classroom use or self-study, this book provides readers with the means to understand the fundamentals and practice of concurrency. Review Quote ..."this well written book [...] will be useful to those designing distributed systems" --Computing Reviews, June 2000 Feature Offers an essential explanation of the concepts, techniques, and problems of concurrency, an area of software design that is useful in a wide range of applications. Examines why concurrency programming is complex and demands a much more formal approach than sequential programming Accessible descriptions and examples illuminate problem patterns, and associated solution approaches help readers harness LTS modeling techniques (accessible on the accompanying Web site) Details ISBN0470093552 Author Jeff Kramer Short Title CONCURRENCY 2/E Language English Edition 2nd ISBN-10 0470093552 ISBN-13 9780470093559 Media Book Format Hardcover DEWEY 005.275 Illustrations Yes Year 2006 Subtitle State Models and Java Programs Birth 1952 Textbook N DOI 10.1604/9780470093559 UK Release Date 2006-04-21 NZ Release Date 2006-04-21 US Release Date 2006-04-21 Edition Description 2nd edition Replaces 9780471987109 Publisher John Wiley & Sons Inc Publication Date 2006-04-21 Imprint John Wiley & Sons Inc Place of Publication New York Country of Publication United States Audience Professional & Vocational AU Release Date 2006-04-20 Pages 448 We've got this At The Nile, if you're looking for it, we've got it. With fast shipping, low prices, friendly service and well over a million items - you're bound to find what you want, at a price you'll love! 30 DAY RETURN POLICY No questions asked, 30 day returns! FREE DELIVERY No matter where you are in the UK, delivery is free. SECURE PAYMENT Peace of mind by paying through PayPal and eBay Buyer Protection TheNile_Item_ID:2533341;

Price: 90.45 GBP

Location: London

End Time: 2025-01-03T12:08:27.000Z

Shipping Cost: 5.99 GBP