Combining Various Solution Techniques for Dynamic Fault Tree Analysis of Computer Systems
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
An Efficient Kronecker Representation for PEPA Models
PAPM-PROBMIV '01 Proceedings of the Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Formal Semantics for Computational Engineering: A Case Study on Dynamic Fault Trees
ISSRE '00 Proceedings of the 11th International Symposium on Software Reliability Engineering
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
| Hi-index | 0.00 |
One of the main attractions of the stochastic process algebra PEPA is its clear compositional structure which allows building a model from elements which reflect the composition of the system to model. Dynamic Fault Trees (DFTs) constitute a simple combinatorial formalism which allows capturing the dynamic behaviour of system failure mechanisms. The resulting model is a combination of component failure events which determines the failure of the complete system. In this paper, we propose to exploit the compositional feature of both PEPA and DFTs in order to develop an automatic translation of a DFT into a PEPA model.