A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
DOI10.1007/978-3-540-75596-8_31zbMath1141.68454OpenAlexW1556549114MaRDI QIDQ3510814
Mariëlle I. A. Stoelinga, Hichem Boudali, Pepijn Crouzen
Publication date: 3 July 2008
Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_31
Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Interactive Markov chains. And the quest for quantified quality
- The theory of interactive generalized semi-Markov processes
- Automated compositional Markov chain generation for a plain-old telephone system
- Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
- A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
- Dynamic fault-tree models for fault-tolerant computer systems
This page was built for publication: A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains