Various Ways to Quantify BDMPs

Bouissou, Marc; Khan, Shahid; Katoen, Joost-Pieter; Krčál, Pavel

doi:10.4204/eptcs.316.1

Cited by 4 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…While the results coincide for both implementations, our implementation is not competitive in terms of computation time and scalability. (We calibrated our implementation using [8] as the RiskSpectrum results were online for this test case [12].) We compare both approaches with the Monte Carlo simulator Yams [7] and evaluate both repairable and non-repairable BDMPs.…”

Section: Resultsmentioning

confidence: 99%

Scalable Reliability Analysis by Lazy Verification

Khan

Katoen

Volk

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

This paper presents an iterative method to analyse system reliability models. The key idea is to analyse a partial state space of a reliability model in a conservative and an optimistic manner. By considering unexplored states as being always operational or, dually, already failed, our analysis yields sound upper-and lower-bounds on the system's reliability. This approach is applied in an iterative manner until the desired precision is obtained. We present details of our approach for Booleanlogic driven Markov processes (BDMPs), an expressive fault tree variant intensively used in analysing energy systems. Based on a prototypical implementation on top of the probabilistic model checker Storm, we experimentally compare our technique to two alternative BDMP analysis techniques: discrete-event simulation obtaining statistical bounds, and a recent closed-form technique for obtaining pessimistic system lifetimes. Our experiments show that mostly only a fragment of the state space needs to be investigated enabling the reliability analysis of models that could not be handled before.S. Khan-supported by a HEC-DAAD scholarship. 1 Known as confidence intervals.

show abstract

Section: Resultsmentioning

confidence: 99%

Scalable Reliability Analysis by Lazy Verification

Khan

Katoen

Volk

et al. 2021

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

“…We will treat the key algorithmic principles and showcase their usage on some industrial cases: the safety for autonomous vehicle guidance [3], the criticality of components in railway station areas [11], and the power supply of a nuclear power plant [1].…”

Section: Verification Conquers Reliability Engineering (Abstract Of I...mentioning

confidence: 99%

Graph Transformation

2021

Lecture Notes in Computer Science

View full text Add to dashboard Cite

material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. The publisher, the authors and the editors are safe to assume that the advice and information in this book are believed to be true and accurate at the date of publication. Neither the publisher nor the authors or the editors give a warranty, expressed or implied, with respect to the material contained herein or for any errors or omissions that may have been made. The publisher remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

show abstract