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

DOI10.1016/S0167-6423(99)00019-2zbMath0941.68649WikidataQ57802118 ScholiaQ57802118MaRDI QIDQ1969600

Holger Hermanns, Joost-Pieter Katoen

Publication date: 10 July 2000

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

Mathematics Subject Classification ID

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

Related Items (12)

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

Uses Software

• LOTOS
• CADP

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