Automated compositional Markov chain generation for a plain-old telephone system

DOI10.1016/S0167-6423(99)00019-2MaRDI QIDQ1969600zbMATH OpenWikidataFDO

Authors Holger Hermanns, Joost-Pieter Katoen

Publication date 10 July 2000

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0167-6423(99)00019-2

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited in

(12)

• On the use of MTBDDs for performability analysis and verification of stochastic systems.
• The quest for minimal quotients for probabilistic and Markov automata
• Probabilistic model checking of complex biological pathways
• Deciding probabilistic automata weak bisimulation: theory and practice
• The how and why of interactive Markov chains
• A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
• Model Based Importance Analysis for Minimal Cut Sets
• Compositional abstraction for stochastic systems
• Polynomial time decision algorithms for probabilistic automata
• YMCA: why Markov chain algebra?
• Process algebra for performance evaluation
• Equivalence checking 40 years after: a review of bisimulation tools

Describes a project that uses

Uses Software

• LOTOS
• CADP

This page was built for publication: Automated compositional Markov chain generation for a plain-old telephone system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969600)