Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains

DOI10.1007/978-3-540-78929-1_18zbMath1144.93379OpenAlexW2130080327MaRDI QIDQ3523111

Tingting Han, Alexandru Mereacre, Joost-Pieter Katoen

Publication date: 2 September 2008

Published in: Hybrid Systems: Computation and Control (Search for Journal in Brave)

Full work available at URL: http://publications.rwth-aachen.de/record/47950

Mathematics Subject Classification ID

Continuous-time Markov processes on discrete state spaces (60J27)

Related Items

A Tutorial on Interactive Markov Chains, Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains, Model Checking HML on Piecewise-Constant Inhomogeneous Markov Chains, The How and Why of Interactive Markov Chains

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interactive Markov chains. And the quest for quantified quality
• An implementation of an efficient algorithm for bisimulation equivalence
• Optimal state-space lumping in Markov chains
• An efficient algorithm for computing bisimulation equivalence
• Compositional modeling and refinement for hierarchical hybrid systems
• Bisimulation relations for dynamical, control, and hybrid systems
• Compositional Modeling and Minimization of Time-Inhomogeneous Markov Chains
• Three Partition Refinement Algorithms
• Exact and ordinary lumpability in finite Markov chains
• Piecewise deterministic Markov processes represented by dynamically coloured Petri nets
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• Process algebra for performance evaluation