Affordable Access

Publisher Website

Mode automata and their compilation into fault trees

Authors
Journal
Reliability Engineering & System Safety
0951-8320
Publisher
Elsevier
Publication Date
Volume
78
Issue
1
Identifiers
DOI: 10.1016/s0951-8320(02)00042-x
Keywords
  • Mode Automata
  • Fault Trees
  • Petri Nets
Disciplines
  • Computer Science

Abstract

Abstract In this article, we advocate the use of mode automata as a high level representation language for reliability studies. Mode automata are states/transitions based representations with the additional notion of flow. They can be seen as a generalization of both finite capacity Petri nets and block diagrams. They can be assembled into hierarchies by means of composition operations. The contribution of this article is twofold. First, we introduce mode automata and we discuss their relationship with other formalisms. Second, we propose an algorithm to compile mode automata into Boolean equations (fault trees). Such a compilation is of interest for two reasons. First, assessment tools for Boolean models are much more efficient than those for states/transitions models. Second, the automated generation of fault trees from higher level representations makes easier their maintenance through the life cycle of systems under study.

There are no comments yet on this publication. Be the first to share your thoughts.

Statistics

Seen <100 times
0 Comments

More articles like this

A Model of Finite Automata on Timed ω-Trees

on Electronic Notes in Theoretica... Jan 01, 2001

Fault trees and Markov models for reliability anal...

on Reliability Engineering & Syst... Jan 01, 1993

Computer-aided fault tree synthesis I (system mode...

on Reliability Engineering & Syst... Jan 01, 1991
More articles like this..