Concurrency in Dependable Computing by Paul Ezhilchelvan (English) Hardcover Boo

Description: Concurrency in Dependable Computing by Paul Ezhilchelvan, Alexander Romanovsky Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Replica management essentially involves ensuring that replicas perceive concurrent events identically. Application of concurrency formalisms for dependability assurance. FORMAT Hardcover LANGUAGE English CONDITION Brand New Publisher Description This text focuses on concurrency related issues in the area of dependable computing. Failures of system components, whether hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability therefore is closely related to, and also benefits from, concurrency theory and formalisms. This beneficial relationship appears to manifest into three strands of work. Concepts such as atomic actions, conversations, exception handling, view synchrony, and so forth, are useful in structuring concurrent activities so as to facilitate attempts at coping with the effects of component failures. The text discusses three main areas: replication induced concurrency management; the application of concurrency formalisms for dependability assurance; and CSP and Petri nets. Replication is a widely used technique for achieving reliability. Replication management essentially involves ensuring that replicas perceive concurrent events identically.Fault-tolerant algorithms are harder to verify than their fault-free counterparts due to the fact that the impact of component faults at each state need to be considered in addition to valid state transitions. CCS are useful tools to specify and verify fault-tolerant designs and protocols. This work explores many significant issues in all three strands. To this end, it is composed as a collection of papers written by authors well-known in their respective areas of reseach. To ensure quality, the papers are reviewd by a panel of at least three experts in the relelvent area. Table of Contents I Role of Modelling and Formalisms for Dependable System Design.- 1 Compositional Development in the Event of Interface Difference.- 2 Model-Based Design of Dependability.- 3 TLA Specification of a Mechanism for Concurrent Exception Handling.- 4 Component Based Dependable System Modelling for Easier Verification.- II Application Specific Modelling for Dependable Design and Analysis.- 5 Digging into Concurrency.- 6 Deadlock Free Control in Automated Guided Vehicle Systems.- 7 Quality Analysis of Dependable Information Systems.- III Event Ordering and its Application.- 8 Fault-Tolerant Sequencer.- 9 QoS Analysis of Group Communication Protocols in Wireless Environment.- 10 Semantically Reliable Broadcast.- 11 Exception Handling in Timed Asynchronous Systems.- IV Transactions and Consistent Checkpointing.- 12 A Recovery Model for Cooperative Computations.- 13 Group Transactions.- 14 Checkpointing in Distributed Computing Systems.- V Concurrency in Real-Time Applications.- 15 Concurrency in Dependable Real-Time Objects. Long Description Concurrency in Dependable Computing focuses on concurrency related issues in the area of dependable computing. Failures of system components, be hardware units or software modules, can be viewed as undesirable events occurring concurrently with a set of normal system events. Achieving dependability therefore is closely related to, and also benefits from, concurrency theory and formalisms. This beneficial relationship appears to manifest into three strands of work. Application level structuring of concurrent activities. Concepts such as atomic actions, conversations, exception handling, view synchrony, etc., are useful in structuring concurrent activities so as to facilitate attempts at coping with the effects of component failures. Replication induced concurrency management. Replication is a widely used technique for achieving reliability. Replica management essentially involves ensuring that replicas perceive concurrent events identically. Application of concurrency formalisms for dependability assurance. Fault-tolerant algorithms are harder to verify than their fault-free counterparts due to the fact that the impact of component faults at each state need to be considered in addition to valid state transitions. CSP, Petri nets, CCS are useful tools to specify and verify fault-tolerant designs and protocols. Concurrency in Dependable Computing explores many significant issues in all three strands. To this end, it is composed as a collection of papers written by authors well-known in their respective areas of research. To ensure quality, the papers are reviewed by a panel of at least three experts in the relevant area. Details ISBN1402070438 Author Alexander Romanovsky Short Title CONCURRENCY IN DEPENDABLE COMP Language English ISBN-10 1402070438 ISBN-13 9781402070433 Media Book Format Hardcover Edited by Paul Ezhilchelvan DEWEY 004.2 Country of Publication United States Pages 310 Imprint Springer-Verlag New York Inc. Place of Publication New York, NY DOI 10.1007/b116534;10.1007/978-1-4757-3573-4 AU Release Date 2002-05-31 NZ Release Date 2002-05-31 US Release Date 2002-05-31 UK Release Date 2002-05-31 Publisher Springer-Verlag New York Inc. Edition Description 2002 ed. Year 2002 Edition 2002nd Publication Date 2002-05-31 Alternative 9781441952783 Illustrations XVIII, 310 p. Audience Undergraduate 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! TheNile_Item_ID:96226802;

Price: 317.54 AUD

Location: Melbourne

End Time: 2025-01-14T21:20:58.000Z

Shipping Cost: 21.83 AUD