Loading…
Applying coloured Petri nets to analyze fail silent nodes in distributed systems
A fail-silent node is a self-checking node composed of a number of conventional fail-uncontrolled processors that work together to provide the following fail-controlled behavior: the node either functions correctly or stops functioning after an internal failure is detected. In a software implemented...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference Proceeding |
Language: | English |
Subjects: | |
Online Access: | Request full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A fail-silent node is a self-checking node composed of a number of conventional fail-uncontrolled processors that work together to provide the following fail-controlled behavior: the node either functions correctly or stops functioning after an internal failure is detected. In a software implemented fail-silent node, the non-faulty processors of the node need to execute message order and comparison protocols to keep in step and check each other respectively. In this paper we present a Petri net model for a software implemented fail-silent node specification. Formal analysis by means of occurrence graph is also shown. |
---|---|
ISSN: | 1062-922X 2577-1655 |
DOI: | 10.1109/ICSMC.1998.725420 |