@article{eprints3579,
           pages = {238--258},
         journal = {Journal of Logical and Algebraic Methods in Programming},
            note = {SCOPUS ID:2-s2.0-84938693695; WOS Accession Number: WOS:000350077300003},
           title = {A unified framework for differential aggregations in Markovian process algebra},
          number = {2},
            year = {2015},
       publisher = {Elsevier},
          volume = {84},
          author = {Max Tschaikowski and Mirco Tribastone},
             url = {http://eprints.imtlucca.it/3579/},
        abstract = {Fluid semantics for Markovian process algebra have recently emerged as a computationally attractive approximate way of reasoning about the behaviour of stochastic models of large-scale systems. This interpretation is particularly convenient when sequential components characterised by small local state spaces are present in many independent copies. While the traditional Markovian interpretation causes state-space explosion, fluid semantics is independent from the multiplicities of the sequential components present in the model, just associating a single ordinary differential equation (ODE) with each local state. In this paper we analyse the case of a process algebra model inducing a large ODE system. Previous work, known as exact fluid lumpability, requires two symmetries: ODE aggregation is possible for processes that i) are isomorphic and that ii) are present with the same multiplicities. We first relax the latter requirement by introducing the notion of ordinary fluid lumpability, which yields an ODE system where the sum of the aggregated variables is preserved exactly. Then, we consider approximate variants of both notions of lumpability which make nearby processes symmetric after a perturbation of their parameters. We prove that small perturbations yield nearby differential trajectories. We carry out our study in the context of a process algebra that unifies two synchronisation semantics that are well studied in the literature, useful for the modelling of computer systems and chemical networks, respectively. In both cases, we provide numerical evidence which shows that, in practice, many heterogeneous processes can be aggregated with negligible errors.}
}