Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(12)
Building Block
Complex System
Continuous Time Markov Chain
Fault Tree Analysis
Formal Model
Reliability Analysis
Semantic Interpretation
State Explosion
State Space
System Dynamics
Fault Tree
Markov Chain
Subscribe
Academic
Publications
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis
Edit
A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis
(
Citations: 3
)
BibTex
|
RIS
|
RefWorks
Download
Hichem Boudali
,
Pepijn Crouzen
,
Mariëlle Stoelinga
Fault trees (FTs) are among the most prominent formalisms for
reliability analysis
of technical systems. Dynamic FTs extend FTs with support for expressing dynamic dependencies among components. The standard analysis vehicle for DFTs is state-based, and treats the model as a continuous-time
Markov chain
(CTMC). This is not always possible, as we will explain, since some DFTs allow multiple interpretations. This paper introduces a rigorous
semantic interpretation
of DFTs. The semantics is defined in such a way that the semantics of a composite DFT arises in a transparent manner from the semantics of its components. This not only eases the understanding of how the FT building blocks interact. It is also a key to alleviate the
state explosion
problem. By lifting a classical aggregation strategy to our setting, we can exploit the DFT structure to build the smallest possible
Markov chain
representation of the system. The semantics - as well as the aggregation and analysis engine is implemented in a tool, called CORAL. We show by a number of realistic and complex systems that this methodology achieves drastic reductions in the state space.
Journal:
IEEE Transactions on Dependable and Secure Computing - TDSC
, vol. 7, no. 2, pp. 128-143, 2010
DOI:
10.1109/TDSC.2009.45
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
dx.doi.org
)
(
www.informatik.uni-trier.de
)
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
More »
Citation Context
(2)
...applications of various domains, ranging from dynamic fault trees [11,10,
12
], architectural description languages such as AADL (Architectural Analysis and Design Language) [9,15,13,14], generalised stochastic Petri nets [40] and Statemate [8] to GALS (Globally Asynchronous Locally Synchronous) hardware design [22,19,23]...
...This is where IMC and its compositionality property can play a pivotal role: The work of Crouzen et al. [
12
,11,10] provides a clean and elegant compositional semantics, a semantics that maps on IMC...
...Example 5. As an example, we demonstrate this approach for a SPARE gate, a functional unit that makes a redundant unit of functionality available (the spare), in case the original unit (the primary) fails [
12
]...
...Fig. 3. A DFT example and six I/O-IMCs that model its behavior [
12
]...
...The congruence property established before is inherited by I/O-IMCs and enables compositional aggregation to combat the state-space explosion problem existing in DFTs, see [10,
12
]...
Holger Hermanns
,
et al.
The How and Why of Interactive Markov Chains
...Moreover, the nice compositional theory for PAs is exploited for compositional minimization [
5
], namely minimizing the automata before composing the components together...
Lei Song
,
et al.
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
References
(23)
Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
(
Citations: 45
)
Christel Baier
,
Holger Hermanns
,
Joost-pieter Katoen
,
Boudewijn R. Haverkort
Journal:
Theoretical Computer Science - TCS
, vol. 345, no. 1, pp. 2-26, 2005
Compositional Dependability Evaluation for STATEMATE
(
Citations: 9
)
Eckard Böde
,
Marc Herbstritt
,
Holger Hermanns
,
Sven Johr
,
Thomas Peikenkamp
,
Reza Pulungan
,
Jan Rakow
,
Ralf Wimmer
,
Bernd Becker
Journal:
IEEE Transactions on Software Engineering - TSE
, vol. 35, no. 2, pp. 274-292, 2009
Architectural dependability evaluation with Arcade
(
Citations: 10
)
Hichem Boudali
,
Pepijn Crouzen
,
Boudewijn R. Haverkort
,
Matthias Kuntz
,
Mariëlle Stoelinga
Conference:
Dependable Systems and Networks - DSN
, pp. 512-521, 2008
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
(
Citations: 20
)
Hichem Boudali
,
Pepijn Crouzen
,
Mariëlle Stoelinga
Conference:
Automated Technology for Verification and Analysis - ATVA
, pp. 441-456, 2007
Coral: a tool for compositional reliability and availability analysis
(
Citations: 3
)
Hichem Boudali
,
Pepijn Crouzen
,
Marielle Stoelinga
Order by:
Citations
(3)
The How and Why of Interactive Markov Chains
(
Citations: 2
)
Holger Hermanns
,
Joost-Pieter Katoen
Conference:
Formal Methods for Components and Objects
, pp. 311-337, 2009
Optical And Microwave Imaging Of The Earth: Today, The EOS Era And Beyond
Unknown
Conference:
IEEE Topical Symposium on Combined Optical, Microwave, Earth and Atmosphere Sensing - COMEAS
, 1993
Bisimulations Meet PCTL Equivalences for Probabilistic Automata
Lei Song
,
Lijun Zhang
,
Jens Godskesen