Modal logics for mobile processes
Selected papers of the 3rd workshop on Concurrency and compositionality
A calculus of mobile processes, I
Information and Computation
Model checking mobile processes
Information and Computation
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Theoretical Computer Science
Resource access control in systems of mobile agents
Information and Computation
Communication and Concurrency
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Nomadic Pict: Language and Infrastructure Design for Mobile Agents
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
Multiple-labelled transition systems for nominal calculi and their logics†
Mathematical Structures in Computer Science
A logical verification methodology for service-oriented computing
ACM Transactions on Software Engineering and Methodology (TOSEM)
| Hi-index | 0.00 |
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 @p-calculus.