De Nicola, Rocco and Loreti, Michele Multi labelled transition systems: a semantic framework for nominal calculi. Electronic Notes in Theoretical Computer Science, 169. pp. 133-146. ISSN 1571-0661 (2007)
- Published Version
Available under License Creative Commons Attribution No Derivatives.
Download (287kB) | Preview
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.
|Funders:||The work presented in this paper has been partially supported by EU Project Software Engineering for Service-Oriented Overlay Computers (SENSORIA, contract IST-3-016004-IP-09).|
|Uncontrolled Keywords:||Mobile Code Languages; Temporal Logics of Programs; Coordination Models; Proof Systems|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Rocco De Nicola|
|Date Deposited:||06 Jun 2011 08:15|
|Last Modified:||08 Oct 2014 09:16|
Actions (login required)