Name
Abstract | ||
|---|---|---|
Redundancy concepts are an integral part of the design of space systems. Deciding when to activate which redundancy and which component should be replaced can be a difficult task. In this paper, we refine a methodology where recovery strategies are synthesized from a model of non-deterministic dynamic fault trees. The synthesis is performed by transforming non-deterministic dynamic fault trees into Markov Automata. From the optimized scheduler, an optimal recovery strategy can then be derived and represented by a model we call Recovery Automaton. We discuss techniques on how this Recovery Automaton can be further optimized to contain fewer states and transitions and show the effectiveness of our approach on two case studies. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-030-12988-0_3 | FTSCS |
Field | DocType | Citations |
Computer science,Automaton,Markov chain,Theoretical computer science,Redundancy (engineering),Formal methods,Fault tree analysis | Conference | 0 |
PageRank | References | Authors |
0.34 | 3 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Liana Mikaelyan | 1 | 0 | 0.34 |
| Sascha Müller | 2 | 3 | 1.52 |
| Andreas Gerndt | 3 | 52 | 12.43 |
| Thomas Noll | 4 | 23 | 6.12 |