Automated generation of partial Markov chain from high level descriptions
Authors:
- P.-A. BrameretPBP.-A. Brameret
- A. RauzyARA. Rauzy
- J.-M. RousselJRJ.-M. Roussel
- 1 July 2015
- journal article
- Published by Elsevier in Reliability Engineering & System Safety
- Vol. 139, 179-187
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Bounds and approximations for continuous-time Markovian transition probabilities and large systemsEuropean Journal of Operational Research, 2008
- The AltaRica data-flow language in use: modeling of production availability of a multi-state systemReliability Engineering & System Safety, 2006
- An experimental study on iterative methods to compute transient solutions of large Markov modelsReliability Engineering & System Safety, 2004
- A new formalism that combines advantages of fault-trees and Markov models: Boolean logic driven Markov processesReliability Engineering & System Safety, 2003
- Computation of bounds for transient measures of large rewarded Markov models using regenerative randomizationComputers & Operations Research, 2003
- Developing a low-cost high-quality software tool for dynamic fault-tree analysisIEEE Transactions on Reliability, 2000
- Efficient descriptor-vector multiplications in stochastic automata networksJournal of the ACM, 1998
- Dependability modeling using Petri-netsIEEE Transactions on Reliability, 1995
- Bounding availability of repairable computer systemsACM SIGMETRICS Performance Evaluation Review, 1989
- A note on two problems in connexion with graphsNumerische Mathematik, 1959