Hostname: page-component-cd9895bd7-p9bg8 Total loading time: 0 Render date: 2024-12-26T08:15:33.940Z Has data issue: false hasContentIssue false
  • English
  • Français

Multiple-Labelled Transition Systems for nominal calculi and their logics†

Published online by Cambridge University Press:  01 February 2008

ROCCO DE NICOLA  and
MICHELE LORETI
ROCCO DE NICOLA
Affiliation:
Dipartimento di Sistemi e Informatica, Viale Morgagni, 65 50134 Firenze, Italy
MICHELE LORETI
Affiliation:
Dipartimento di Sistemi e Informatica, Viale Morgagni, 65 50134 Firenze, Italy
Get access Rights & Permissions [Opens in a new window]

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.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 18 , Special Issue 1: in memory of Sauro Tulipani , February 2008 , pp. 107 - 143
Copyright
Copyright © Cambridge University Press2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Amadio, R. M., Castellani, I. and Sangiorgi, D. (1998) On bisimulations for the asynchronous π-calculus. Theoretical Computer Science 195 2291–324.CrossRefGoogle Scholar
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 88–150.CrossRefGoogle Scholar
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 38–57.CrossRefGoogle Scholar
Boudol, G. (1992) Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sophia-Antipolis.Google Scholar
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 72–89.CrossRefGoogle Scholar
Cardelli, L. and Gordon, A. D. (2000) Mobile ambients. Theoretical Computer Science 240 1177–213.CrossRefGoogle Scholar
Cardelli, L. and Gordon, A. D. (2006) Ambient logic. Mathematical Structures in Computer Science (to appear).Google Scholar
Carriero, N. and Gelernter, D. (1989) Linda in Context. Communications of the ACM 32 10444–458.CrossRefGoogle Scholar
Castagna, G., Vitek, J. and Nardelli, F. Z. (2005) The Seal Calculus. Information and Computation 201 11–54.CrossRefGoogle Scholar
Dam, M. (1996) Model checking mobile processes. Journal of Information and Computation 129 135–51.CrossRefGoogle Scholar
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 5315–330.CrossRefGoogle Scholar
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 95–119.CrossRefGoogle Scholar
Ferrari, G., Montangero, C., Semini, L. and Semprini, S. (2002) Mark, a reasoning kit for mobility. Automated Software Engineering 9 137–150.CrossRefGoogle Scholar
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 406–421.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Gelernter, D. (1985) Generative Communication in Linda. ACM Transactions on Programming Languages and Systems 7 180–112.CrossRefGoogle Scholar
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 20–27.CrossRefGoogle Scholar
Hennessy, M. and Milner, R. (1985) Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32 1137–161.CrossRefGoogle Scholar
Hennessy, M. and Riely, J. (2002) Resource access control in systems of mobile agents. Information and Computation 173 182–120.CrossRefGoogle Scholar
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 133–147.CrossRefGoogle Scholar
McCann, P.. and Roman, G.-C. (1998) Compositional programming abstraction for mobile computing. IEEE Transactions on Software Engineering 24 297–110.CrossRefGoogle Scholar
Milner, R., Parrow, J. and Walker, D. (1993) Modal logics for mobile processes. Theoretical Computer Science 114 149–171.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Wojciechowski, P. T. and Sewell, P. (1999) Nomadic Pict: Language and infrastructure design for mobile agents. In: ASA/MA, IEEE Computer Society 2–12.CrossRefGoogle Scholar