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 π-calculus. © 2007 Published by Elsevier B.V.
De Nicola, R., & Loreti, M. (2007). Multi labelled transition systems: A semantic framework for nominal calculi. Electronic Notes in Theoretical Computer Science, 169(SUPPL.), 133–146. https://doi.org/10.1016/j.entcs.2007.05.019