%0 Journal Article
%@ 0960-1295
%A De Nicola, Rocco
%A Loreti, Michele
%D 2008
%F eprints:283
%I Cambridge University Press
%J Mathematical Structures in Computer Science
%N 1
%P 107-143
%T Multiple-Labelled Transition Systems for nominal calculi and their logics
%U http://eprints.imtlucca.it/283/
%V 18
%X 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 μ-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 μKlaim and the asynchronous π-calculus.