Inproceedings1737293459: Unterschied zwischen den Versionen
Aus International Center for Computational Logic
Johannes Lehmann (Diskussion | Beiträge) (Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Clemens |ErsterAutorNachname=Dubslaff |FurtherAuthors=Kai Ding; Andrey Morozov; Christel Baier; Klaus Janschek}} {{Inproceedings |Booktitle=Proc. of 29th European Safety and Reliability Conference (ESREL) |Pages=2317--2325 |Title=Breaking the Limits of Redundancy Systems Analysis |Year=2019 }} {{Publikation Details |DOI Name=10.3850/978-981-11-2724-3_0618-cd |Abstract=Redundancy mechanisms such as…“) |
Johannes Lehmann (Diskussion | Beiträge) K (Textersetzung - „Verifikation und formale quantitative Analyse“ durch „Algebraische und logische Grundlagen der Informatik“) |
||
| Zeile 12: | Zeile 12: | ||
|DOI Name=10.3850/978-981-11-2724-3_0618-cd | |DOI Name=10.3850/978-981-11-2724-3_0618-cd | ||
|Abstract=Redundancy mechanisms such as triple modular redundancy protect safety-critical components by replication and thus improve systems fault tolerance. However, the gained fault tolerance comes along with costs to be invested, e.g., increasing execution time, energy consumption, or packaging size, for which constraints have to be obeyed during system design. This turns the question of finding suitable combinations of components to be protected into a challenging task as the number of possible protection combinations grows exponentially in the number of components. We propose family-based approaches to tackle the combinatorial blowup in redundancy systems modeling and analysis phases. Based on systems designed in SIMULINK we show how to obtain models that include all possible protection combinations and present a tool chain that, given a probabilistic error model, generates discrete Markov chain families. Using symbolic techniques that enable concise family representation and analysis, we show how SIMULINK models of realistic size can be protected and analyzed with a single family-based analysis run while a one-by-one analysis of each protection combination would clearly exceed any realistic time constraints. | |Abstract=Redundancy mechanisms such as triple modular redundancy protect safety-critical components by replication and thus improve systems fault tolerance. However, the gained fault tolerance comes along with costs to be invested, e.g., increasing execution time, energy consumption, or packaging size, for which constraints have to be obeyed during system design. This turns the question of finding suitable combinations of components to be protected into a challenging task as the number of possible protection combinations grows exponentially in the number of components. We propose family-based approaches to tackle the combinatorial blowup in redundancy systems modeling and analysis phases. Based on systems designed in SIMULINK we show how to obtain models that include all possible protection combinations and present a tool chain that, given a probabilistic error model, generates discrete Markov chain families. Using symbolic techniques that enable concise family representation and analysis, we show how SIMULINK models of realistic size can be protected and analyzed with a single family-based analysis run while a one-by-one analysis of each protection combination would clearly exceed any realistic time constraints. | ||
|Forschungsgruppe= | |Forschungsgruppe=Algebraische und logische Grundlagen der Informatik | ||
}} | }} | ||
Aktuelle Version vom 5. März 2025, 14:45 Uhr
Breaking the Limits of Redundancy Systems Analysis
Clemens DubslaffClemens Dubslaff, Kai DingKai Ding, Andrey MorozovAndrey Morozov, Christel BaierChristel Baier, Klaus JanschekKlaus Janschek
Clemens Dubslaff, Kai Ding, Andrey Morozov, Christel Baier, Klaus Janschek
Breaking the Limits of Redundancy Systems Analysis
Proc. of 29th European Safety and Reliability Conference (ESREL), 2317--2325, 2019
Breaking the Limits of Redundancy Systems Analysis
Proc. of 29th European Safety and Reliability Conference (ESREL), 2317--2325, 2019
- KurzfassungAbstract
Redundancy mechanisms such as triple modular redundancy protect safety-critical components by replication and thus improve systems fault tolerance. However, the gained fault tolerance comes along with costs to be invested, e.g., increasing execution time, energy consumption, or packaging size, for which constraints have to be obeyed during system design. This turns the question of finding suitable combinations of components to be protected into a challenging task as the number of possible protection combinations grows exponentially in the number of components. We propose family-based approaches to tackle the combinatorial blowup in redundancy systems modeling and analysis phases. Based on systems designed in SIMULINK we show how to obtain models that include all possible protection combinations and present a tool chain that, given a probabilistic error model, generates discrete Markov chain families. Using symbolic techniques that enable concise family representation and analysis, we show how SIMULINK models of realistic size can be protected and analyzed with a single family-based analysis run while a one-by-one analysis of each protection combination would clearly exceed any realistic time constraints. - Forschungsgruppe:Research Group: Algebraische und logische Grundlagen der InformatikAlgebraic and Logical Foundations of Computer Science
@inproceedings{DDMBJ2019,
author = {Clemens Dubslaff and Kai Ding and Andrey Morozov and Christel
Baier and Klaus Janschek},
title = {Breaking the Limits of Redundancy Systems Analysis},
booktitle = {Proc. of 29th European Safety and Reliability Conference (ESREL)},
year = {2019},
pages = {2317--2325},
doi = {10.3850/978-981-11-2724-3_0618-cd}
}
