Concurrency Meets Probability: Theory and Practice

I will combine "classical" Markov chains with "modern" concurrency theory and argue that such a marriage is needed for the trustworthy design of dependable systems. I'll present the resulting modeling formalism, and some quantitative analysis algorithms that rely on Markov decision theory. In the second part, I'll discuss its merits in industrial settings such as the European Space Agency and the Dutch Railways.