Distributed Bounded Predictability

Complex systems often exhibit unexpected faults that are difficult to handle. A system that is predictable can anticipate faults and act accordingly. In particular, bounded predictability offers information that can be exploited by the system to adopt the best contingency plan. Such information is o...

Full description

Saved in:
Bibliographic Details
Main Authors: Briones, Laura Brandan, Madalinski, Agnes
Format: Conference Proceeding
Language:English
Subjects:
Complex systems
Discrete-event systems
distributed systems
Electronic mail
Fault diagnosis
predictability
Software engineering
Synchronization
Upper bound
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Complex systems often exhibit unexpected faults that are difficult to handle. A system that is predictable can anticipate faults and act accordingly. In particular, bounded predictability offers information that can be exploited by the system to adopt the best contingency plan. Such information is offered in form of a lower and upper bound. A lower bound guarantees a fault to occur after certain execution event, whereas an upper bound guarantees a fault to occur, in the future, but before some event. Complex systems are usually built from simpler components running concurrently. We study how to infer the bounded predictability property of a complex system (distributed and with multiple faults) from a parallel verification of bounded predictability of each of its components synchronising with fault free versions of the other one.
ISSN:1522-4902
2691-0632
DOI:10.1109/SCCC.2013.25