Advertisement

Concurrency in Dependable Computing

  • Paul Ezhilchelvan
  • Alexander Romanovsky

Table of contents

  1. Front Matter
    Pages i-xvii
  2. Role of Modelling and Formalisms for Dependable System Design

    1. Front Matter
      Pages 1-1
    2. Jonathan Burton, Maciej Koutny, Giuseppe Pappalardo, Marta Pietkiewicz-Koutny
      Pages 3-22
    3. Anish Arora, Rajesh Jagannathan, Yi-Min Wang
      Pages 23-40
    4. Avelino Francisco Zorzo, Brian Randell, Alexander Romanovsky
      Pages 41-59
    5. Didier Buchs, David Hurzeler, Sandro Costa
      Pages 61-83
  3. Application Specific Modelling for Dependable Design and Analysis

    1. Front Matter
      Pages 85-85
    2. Angie Chandler, Serena Patching, Lynne Blair
      Pages 87-104
    3. Apostolos Zarras, Valerie Issarny
      Pages 127-145
  4. Event Ordering and Its Application

    1. Front Matter
      Pages 147-147
    2. Roberto Baldoni, Carlo Marchetti, Sara Tucci Piergiovanni
      Pages 149-167
    3. Andrea Bondavalli, Andrea Coccoli, Felicita Di Giandomenico
      Pages 169-188
    4. José Pereira, Luis Rodrigues, Rui Oliveira
      Pages 189-207
    5. Robert Miller, Anand Tripathi
      Pages 209-227
  5. Transactions and Consistent Checkpointing

    1. Front Matter
      Pages 229-229
    2. Edgar Nett, Michael Mock
      Pages 231-251
    3. Marta Patiño-Martínez, Ricardo Jiménez-Peris, Sergio Arévalo
      Pages 253-271
    4. Lalit Kumar, Manoj Mishra, Ramesh Chander Joshi
      Pages 273-289
  6. Concurrency in Real-Time Applications

    1. Front Matter
      Pages 291-291
    2. K. H. Kane Kim
      Pages 293-310

About this book

Introduction

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.

Keywords

QoS algorithms communication concurrency distributed computing information tools

Editors and affiliations

  • Paul Ezhilchelvan
    • 1
  • Alexander Romanovsky
    • 1
  1. 1.University of Newcastle-upon-TyneUK

Bibliographic information