\textsf{PFL}: a probabilistic logic for fault trees

DOI10.1007/978-3-031-27481-7_13zbMath1529.68162arXiv2303.17314OpenAlexW4323026687MaRDI QIDQ6174535

Mariëlle I. A. Stoelinga, Stefano M. Nicoletti, Ernst Moritz Hahn, Milan Lopuhaä-Zwakenberg

Publication date: 17 August 2023

Published in: Formal Methods (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.17314

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Unnamed Item
• Model-checking in dense real-time
• A logic for reasoning about time and reliability
• Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools
• Mathematical Logic for Computer Science
• SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• The Probabilistic Model Checking Landscape
• Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity
• Convex Optimization for Parameter Synthesis in MDPs
• Accelerated model checking of parametric Markov chains

This page was built for publication: \textsf{PFL}: a probabilistic logic for fault trees