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

Mathematics Subject Classification ID

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)

A General Framework for Probabilistic Characterizing Formulae ⋮ A compositional model to reason about end-to-end QoS in stochastic Reo connectors ⋮ A Tutorial on Interactive Markov Chains ⋮ Sensitivity Analysis of Continuous Time Bayesian Network Reliability Models ⋮ A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains ⋮ \textsf{PFL}: a probabilistic logic for fault trees ⋮ Unnamed Item ⋮ Model Based Importance Analysis for Minimal Cut Sets ⋮ On the Minimisation of Acyclic Models ⋮ RiskStructures: a design algebra for risk-aware machines ⋮ Persistent Stochastic Non-Interference ⋮ The How and Why of Interactive Markov Chains ⋮ The linear time-branching time spectrum of equivalences for stochastic systems with non-determinism ⋮ Bisimulations Meet PCTL Equivalences for Probabilistic Automata ⋮ Fault tree analysis: a survey of the state-of-the-art in modeling, analysis and tools

Uses Software

• CADP
• DIFtree

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