@article{eprints283,
       publisher = {Cambridge University Press},
           pages = {107--143},
           title = {Multiple-Labelled Transition Systems for nominal calculi and their logics},
         journal = {Mathematical Structures in Computer Science},
          author = {Rocco De Nicola and Michele Loreti},
            year = {2008},
          number = {1},
          volume = {18},
             url = {http://eprints.imtlucca.it/283/},
        abstract = {Action-labelled transition systems (LTSs) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper we introduce Multiple-Labelled Transition Systems (MLTSs) as generalisations of LTSs that enable us to deal with system features that are becoming increasingly important when considering languages and models for network-aware programming. MLTSs enable us to describe not only the actions that systems can perform but also their usage of resources and their handling (creation, revelation . . .) of names; these are essential for modelling changing evaluation environments. We also introduce MoMo, which is a logic inspired by Hennessy?Milner Logic and the {\ensuremath{\mu}}-calculus, that enables us to consider state properties in a distributed environment and the impact of actions and movements over the different sites. MoMo operators are interpreted over MLTSs and both MLTSs and MoMo are used to provide a semantic framework to describe two basic calculi for mobile computing, namely {\ensuremath{\mu}}Klaim and the asynchronous {\ensuremath{\pi}}-calculus.}
}