Sequential Logic for State/Event Fault Trees: A Methodology to Support the Failure Modeling of Cyber Physical Systems (bibtex)
by Michael Roth, Peter Liggesmeyer
Abstract:
The society is nowadays increasingly controlled through embedded systems. The certication process of such systems is often supported by tree based approaches like fault trees. Nevertheless, these methodologies have some crucial drawbacks when it comes to dynamic systems. In the standard fault tree analysis it is not possible to model dependent events as well as timing behavior. To deal with these disadvantages state/event fault trees (SEFTs) were developed. However, this method is mainly restricted to academic problems due to its poor analysis procedures. To overcome this problem, this paper introduces a new qualitative analysis technique for SEFTs based on event sequences that can be identied out of their reachability graphs. To analyze these sequences an event sequence minimization schema similar to minimal cut sets of normal fault trees is proposed. Afterwards, a sequence algebra is used to further minimize these temporal expressions and transform them as far as possible int o static ones.
Reference:
M. Roth, P. Liggesmeyer, "Sequential Logic for State/Event Fault Trees: A Methodology to Support the Failure Modeling of Cyber Physical Systems", in Computer Safety, Reliability, and Security, F. Koornneef, C. van Gulijk, Eds., Springer International Publishing, 2015, pp. 121-132.
Bibtex Entry:
@InCollection{Roth15a,
  Title                    = {Sequential Logic for State/Event Fault Trees: A Methodology to Support the Failure Modeling of Cyber Physical Systems},
  Author                   = {Michael Roth AND Peter Liggesmeyer},
  Booktitle                = {Computer Safety, Reliability, and Security},
  Publisher                = {Springer International Publishing},
  Year                     = {2015},
  Editor                   = {Koornneef, Floor and van Gulijk, Coen},
  Pages                    = {121-132},
  Series                   = {Lecture Notes in Computer Science},
  Abstract                 = {The society is nowadays increasingly controlled through embedded systems. The certication process of such systems is often supported by tree based approaches like fault trees. Nevertheless, these methodologies have some crucial drawbacks when it comes to dynamic systems. In the standard fault tree analysis it is not possible to model dependent events as well as timing behavior. To deal with these disadvantages state/event fault trees (SEFTs) were developed. However, this method is mainly restricted to academic problems due to its poor analysis procedures. To overcome this problem, this paper introduces a new qualitative analysis technique for SEFTs based on event sequences that can be identied out of their reachability graphs. To analyze these sequences an event sequence minimization schema similar to minimal cut sets of normal fault trees is proposed. Afterwards, a sequence algebra is used to further minimize these temporal expressions and transform them as far as possible int o static ones.},
  Doi                      = {10.1007/978-3-319-24249-1_11},
  ISBN                     = {978-3-319-24248-4},
  Keywords                 = {state event fault tree, fault tree, sequential logic, reliability analysis, cyber physical system},
  Language                 = {English},
  Url                      = {http://dx.doi.org/10.1007/978-3-319-24249-1_11}
}
Powered by bibtexbrowser