The society is nowadays increasingly controlled through embedded systems. The certification 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 identified 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 into static ones.
Roth, M., & Liggesmeyer, P. (2015). Sequential logic for state/event fault trees: A methodology to support the failure modeling of cyber physical systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9338, pp. 121–132). Springer Verlag. https://doi.org/10.1007/978-3-319-24249-1_11