TY  - JOUR
Y1  - 2007///
A1  - De Nicola, Rocco
A1  - Loreti, Michele
N2  - Action Labelled transition systems (LTS) have proved to be a fundamental model for describing and proving properties of concurrent systems. In this paper, Multiple Labelled Transition Systems (MLTS) are introduced as generalizations of LTS that permit dealing also with systems features that are becoming more and more important when considering languages and models for network aware programming. MLTS permit describing not only the actions systems can perform but also system's resources usage and their handling (creation, revelation ...) of names. To show adeguacy of our proposal we show how MLTS can be used to describe the operational semantics of one of the most studied calculus for mobility: the asynchronous [pi]-calculus.
TI  - Multi labelled transition systems: a semantic framework for nominal calculi
VL  - 169
ID  - eprints289
JF  - Electronic Notes in Theoretical Computer Science
SN  - 1571-0661
AV  - public
SP  - 133
UR  - http://www.sciencedirect.com/science/article/pii/S1571066107003362
PB  - Elsevier
EP  - 146
KW  - Mobile Code Languages; Temporal Logics of Programs; Coordination Models; Proof Systems
ER  -