We survey compositional automata models for quantitative verification.
The models allow probabilistic decisions, real-time phenomena and continuous dynamics.
We give an intuitive definition and a small illustrative example for each model.
We systematically classify the models and summarise available formal analysis techniques.