“…Such studies go back to the early 1990s and reached their full maturity in the 2000s, where it is easy to find an amount of extensions and variants of both qualitative and quantitative languages. In the setting of QAPL, we can mention several such examples: probabilistic variant of the process-algebraic µCRL language [90], discrete time variant of distributed πcalculus [48], probabilistic extension of π-calculus [117], interleaving semantics and true concurrent semantics for the probabilistic variant of π-calculus [142], stochastic broadcast π-calculus [131], stochastic version of Mobile Ambient [143], stochastic extension of the hybrid process algebra HYPE [32,33,68], stochastic extension of the Software Component Ensemble Language for modeling ensemble based autonomous systems [101], Linda-like coordination calculus extended with quantitative information [38], and finally a mixture of concurrent and probabilistic Kleene algebras enriched with probabilistic choices [110]. Further examples include process calculi for performance evaluation, like LYSA [28], proposed for the context of cryptographic protocols, CARMA [31], specifically defined for collective adaptive systems, MELA [107], for modeling in ecology with location attributes, and PEPA Queues [13], introduced for the modeling of queueing networks with mobility features.…”