Beyond memoryless distributions: model checking semi-Markov chains

DOI10.1007/3-540-44804-7_4MaRDI QIDQ4798032zbMATH OpenFDO

Authors Gabriel Infante-Lopez, Holger Hermanns, Joost-Pieter Katoen

Publication date 18 March 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2165/21650057.htm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model-checking continuous-time Markov chains
• Model checking infinite-state Markov chains
• Model checking continuous-time Markov chains by transient analysis
• Model checking CSL until formulae with random time bounds
• Model checking conditional CSL for continuous-time Markov chains

Cited in

(10)

• Hypergraph-based parallel computation of passage time densities in large semi-Markov models
• Timed comparisons of semi-Markov processes
• Model checking expected time and expected reward formulae with random time bounds
• Statistical probabilistic model checking with a focus on time-bounded properties
• Simulation of generalised semi-Markov processes based on graph transformation systems
• A Tutorial on Interactive Markov Chains
• On the total variation distance of semi-Markov chains
• Fixed-delay events in generalized semi-Markov processes revisited
• Calculating Probabilities of Real-Time Test Cases
• Model-checking continuous-time Markov chains

This page was built for publication: Beyond memoryless distributions: model checking semi-Markov chains

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