Automated compositional Markov chain generation for a plain-old telephone system
Science of Computer Programming
The theory of interactive generalized semi-Markov processes
Theoretical Computer Science
On Combining Functional Verification and Performance Evaluation Using CADP
FME '02 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods - Getting IT Right
Formal Semantics for Computational Engineering: A Case Study on Dynamic Fault Trees
ISSRE '00 Proceedings of the 11th International Symposium on Software Reliability Engineering
An incremental approach to reachability analysis of distributed programs
IWSSD '93 Proceedings of the 7th international workshop on Software specification and design
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2004)
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Uniformity by Construction in the Analysis of Nondeterministic Stochastic Systems
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Quantitative evaluation in embedded system design: trends in modeling and analysis techniques
Proceedings of the conference on Design, automation and test in Europe
Effective Minimization of Acyclic Phase-Type Representations
ASMTA '08 Proceedings of the 15th international conference on Analytical and Stochastic Modeling Techniques and Applications
On the Minimisation of Acyclic Models
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
DFTSim: a simulation tool for extended dynamic fault trees
SpringSim '09 Proceedings of the 2009 Spring Simulation Multiconference
Time-bounded reachability in distributed input/output interactive probabilistic chains
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
The how and why of interactive Markov chains
FMCO'09 Proceedings of the 8th international conference on Formal methods for components and objects
FASE'11/ETAPS'11 Proceedings of the 14th international conference on Fundamental approaches to software engineering: part of the joint European conferences on theory and practice of software
A2thOS: availability analysis and optimisation in SLAs
International Journal of Network Management
A compositional model to reason about end-to-end QoS in Stochastic Reo connectors
Science of Computer Programming
| Hi-index | 0.00 |
Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of DFTs in terms of input/output interactive Markov chains (I/O-IMCs), which extend continuous-time Markov chains with discrete input, output and internal actions. This semantics provides a rigorous basis for the analysis of DFTs. Our semantics is fully compositional, that is, the semantics of a DFT is expressed in terms of the semantics of its elements (i.e. basic events and gates). This enables an efficient analysis of DFTs through compositional aggregation, which helps to alleviate the state-space explosion problem by incrementally building the DFT state space. We have implemented our methodology by developing a tool, and showed, through four case studies, the feasibility of our approach and its effectiveness in reducing the state space to be analyzed.