TY  - JOUR
UR  - http://dx.doi.org/10.1017/S0960129507006585
JF  - Mathematical Structures in Computer Science
A1  - De Nicola, Rocco
A1  - Loreti, Michele
Y1  - 2008///
PB  - Cambridge University Press
VL  - 18
IS  - 1
AV  - none
SN  - 0960-1295
ID  - eprints283
EP  - 143
TI  - Multiple-Labelled Transition Systems for nominal calculi and their logics
SP  - 107
N2  - 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.
ER  -