From Concurrency Models to Numbers: Performancd and Dependability

Discrete-state Markov processes are very common models used for performance and dependability evaluation of, for example, distributed information and communication systems. Over the last fifteen years, compositional model construction and model checking algorithms have been studied for these processes, and variations thereof, especially processes incorporating nondeterministic choices.

In this paper we give a survey of model checking and compositional model construction for such processes in discrete and continuous time.