Skip to main content
×
×
Home

Multiple-Labelled Transition Systems for nominal calculi and their logics

  • ROCCO DE NICOLA (a1) and MICHELE LORETI (a1)
Abstract

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.

Copyright
References
Hide All
Amadio, R. M., Castellani, I. and Sangiorgi, D. (1998) On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195 2291324.
Bettini, L., Bono, V., De Nicola, R., Ferrari, G., Gorla, D., Loreti, M., Moggi, E., Pugliese, R., Tuosto, E. and Venneri, B. (2003) The klaim project: Theory and practice. In: Global Computing. Springer-Verlag Lecture Notes in Computer Science 2874 88150.
Boreale, M., Bruni, R., Caires, L., De Nicola, R., Lanese, I., Loreti, M., Martins, F., Montanari, U., Ravara, A., Sangiorgi, D., Vasconcelos, V. and Zavattaro, G. (2006) SCC: a service centered calculus. In: Web Services and Formal Methods, Third International Workshop, WS-FM 2006. Springer-Verlag Lecture Notes in Computer Science 4184 3857.
Boudol, G. (1992) Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis.
Caires, L. (2004) Behavioral and spatial observations in a logic for the pi-calculus. In: Walukiewicz, I. (ed.) FoSSaCS. Springer-Verlag Lecture Notes in Computer Science 2987 7289.
Cardelli, L. and Gordon, A. D. (2000) Mobile ambients. Theoretical Computer Science 240 1177213.
Cardelli, L. and Gordon, A. D. (2006) Ambient logic. Mathematical Structures in Computer Science (to appear).
Carriero, N. and Gelernter, D. (1989) Linda in Context. Communications of the ACM 32 10444458.
Castagna, G., Vitek, J. and Nardelli, F. Z. (2005) The Seal Calculus. Information and Computation 201 1154.
Dam, M. (1996) Model checking mobile processes. Journal of Information and Computation 129 13551.
De Nicola, R.Ferrari, G. L. and Pugliese, R. (1998) KLAIM: A kernel language for agents interaction and mobility. IEEE Transactions on Software Engineering 24 5315330.
De Nicola, R. and Loreti, M. (2005) MoMo: A modal logic for reasoning about mobility. In: de Boer, F. S. Bonsangue, M. M., Graf, S. and de Roever, W. P. (eds.) Proc. of FMCO 2004, Revised Lectures. Springer-Verlag Lecture Notes in Computer Science 3657 95119.
Ferrari, G., Montangero, C., Semini, L. and Semprini, S. (2002) Mark, a reasoning kit for mobility. Automated Software Engineering 9 137150.
Fournet, C., Gonthier, G., Levy, J. J., Maranget, L. and Remy, D. (1996) A Calculus of Mobile Agents. In: Montanari, U. and Sassone, V. (eds.) Proc. of 7th Int. Conf. on Concurrency Theory (CONCUR'96). Springer-Verlag Lecture Notes in Computer Science 1119 406421.
Gabbay, M. and Pitts, A. M. (1999) A new approach to abstract syntax involving binders. Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, IEEE Computer Society 214–224.
Gelernter, D. (1985) Generative Communication in Linda. ACM Transactions on Programming Languages and Systems 7 180112.
Gelernter, D. (1989) Multiple Tuple Spaces in Linda. In: Odijk, E., Rem, M. and Syre, J.-C. (eds.) Proceedings, PARLE'89. Springer-Verlag Lecture Notes in Computer Science 366 2027.
Hennessy, M. and Milner, R. (1985) Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32 1137161.
Hennessy, M. and Riely, J. (2002) Resource access control in systems of mobile agents. Information and Computation 173 182120.
Honda, K. and Tokoro, M. (1991) An object calculus for asynchronous communication. In: America, P. (ed.) European Conference on Object-Oriented Programming (ECOOP'91). Springer-Verlag Lecture Notes in Computer Science 512 133147.
McCann, P.. and Roman, G.-C. (1998) Compositional programming abstraction for mobile computing. IEEE Transactions on Software Engineering 24 297110.
Milner, R., Parrow, J. and Walker, D. (1993) Modal logics for mobile processes. Theoretical Computer Science 114 149171.
Reynolds, J. C. (2002) Separation logic: A logic for shared mutable data structures. In: Proceedings of 17th IEEE Symposium on Logic in Computer Science, IEEE Computer Society 55–74.
Wojciechowski, P. T. and Sewell, P. (1999) Nomadic Pict: Language and infrastructure design for mobile agents. In: ASA/MA, IEEE Computer Society 2–12.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed