Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-25T08:17:21.625Z Has data issue: false hasContentIssue false
  • English
  • Français

RPO semantics for mobile ambients†

Published online by Cambridge University Press:  26 June 2014

FILIPPO BONCHI ,
FABIO GADDUCCI  and
GIACOMA VALENTINA MONREALE
FILIPPO BONCHI
Affiliation:
ENS Lyon, Université de Lyon, LIP (UMR 5668 CNRS ENS Lyon UCBL INRIA), Lyon, France Email: [email protected]
FABIO GADDUCCI
Affiliation:
Dipartimento di Informatica, Università di Pisa, Pisa, Italy Email: [email protected]; [email protected]
GIACOMA VALENTINA MONREALE
Affiliation:
Dipartimento di Informatica, Università di Pisa, Pisa, Italy Email: [email protected]; [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

In this paper we focus on the synthesis of labelled transition systems (LTSs) for process calculi using Mobile Ambients (MAs) as a testbed. Our proposal is based on a graphical encoding: a process is mapped into a graph equipped with interfaces such that the denotation is fully abstract with respect to the standard structural congruence. Graphs with interfaces are amenable to the synthesis mechanism based on borrowed contexts (BCs), which is an instance of relative pushouts (RPOs). The BC mechanism allows the effective construction of an LTS that has graphs with interfaces as states and labels, and such that the associated bisimilarity is a congruence. We focus here on the analysis of an LTS over processes as graphs with interfaces: we use the LTS on graphs to recover an LTS directly defined over the structure of MA processes and define a set of SOS inference rules capturing the same operational semantics.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 24 , Issue 4: Structure Transformation , August 2014 , 240404
Copyright
Copyright © Cambridge University Press 2014 

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.)

Footnotes

†

This research was partially supported by the EU FP7-ICT IP ASCEns (IP 257414) and by the MIUR PRIN SisteR (PRIN 20088HXMYN).

References

Baldan, P., Corradini, A., Ehrig, H., Löwe, M., Montanari, U. and Rossi, F. (1999) Concurrent semantics of algebraic graph transformation. In: Ehrig, H., Kreowski, H.-J., Montanari, U. and Rozenberg, G. (eds.) Concurrency, Parallelism, and Distribution. Handbook of Graph Grammars and Computing by Graph Transformation 3: Concurrency, Parallelism, and Distribution, World Scientific 107–187.Google Scholar
Baldan, P., Ehrig, H. and König, B. (2006) Composition and decomposition of DPO transformations with borrowed context. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L. and Rozemberg, G. (eds.) Graph Transformation. Springer-Verlag Lecture Notes in Computer Science 4178 153–167.CrossRefGoogle Scholar
Bonchi, F. (2008) Abstract Semantics by Observable Contexts, Ph.D. thesis, Department of Informatics, University of Pisa.Google Scholar
Bonchi, F. and Montanari, U. (2007) Coalgebraic models for reactive systems. In: Caires, L. and Vasconcelos, V. (eds.) Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 4703 364–379.Google Scholar
Bonchi, F., Gadducci, F. and König, B. (2006a) Process bisimulation via a graphical encoding. In: Corradini, A., Ehrig, H., Montanari, U., Ribeiro, L. and Rozemberg, G. (eds.) Graph Transformation. Springer-Verlag Lecture Notes in Computer Science 4178 168–183.Google Scholar
Bonchi, F., Gadducci, F. and Monreale, G. V. (2009a) Labelled transitions for mobile ambients (as synthesized via a graphical encoding). In: Hildebrandt, T. and Gorla, D. (eds.) Expressiveness in Concurrency. Electronic Notes in Theoretical Computer Science 242 (1)73–98.Google Scholar
Bonchi, F., Gadducci, F. and Monreale, G. V. (2009b) On barbs and labels in reactive systems. In: Klin, B. and Sobociński, P. (eds.) Structural Operational Semantics. Electronic Proceedings in Theoretical Computer Science 18 46–61.Google Scholar
Bonchi, F., Gadducci, F. and Monreale, G. V. (2009c) Reactive systems, barbed semantics, and the mobile ambients. In: de Alfaro, L. (ed.) Foundations of Software Science and Computation Structures. Springer-Verlag Lecture Notes in Computer Science 5504 272–287.Google Scholar
Bonchi, F., König, B. and Montanari, U. (2006b) Saturated semantics for reactive systems. In: Logic in Computer Science, IEEE Computer Society 69–80.Google Scholar
Cardelli, L. and Gordon, A. (2000) Mobile ambients. Theoretical Computer Science 240 (1)177–213.Google Scholar
Corradini, A. and Gadducci, F. (1999) An algebraic presentation of term graphs, via gs-monoidal categories. Applied Categorical Structures 7 (4)299–331.Google Scholar
Ehrig, H., Ehrig, K., Prange, U. and Taentzer, G. (2006) Fundamentals of Algebraic Graph Transformation, Springer-Verlag.Google Scholar
Ehrig, H. and König, B. (2006) Deriving bisimulation congruences in the DPO approach to graph rewriting with borrowed contexts. Mathematical Structurer in Computer Science 16 (6)1133–1163.Google Scholar
Ferrari, G., Montanari, U. and Tuosto, E. (2001) A LTS semantics of ambients via graph synchronization with mobility. In: Restivo, A., Ronchi Della Rocca, S. and Roversi, L. (eds.) Italian Conference on Theoretical Computer Science. Springer-Verlag Lecture Notes in Computer Science 2202 1–16.Google Scholar
Gadducci, F. and Monreale, G. V. (2008) A decentralized implementation of mobile ambients. In: Heckel, R. and Taentzer, G. (eds.) Graph Transformation. Springer-Verlag Lecture Notes in Computer Science 5214 115–130.Google Scholar
Gadducci, F. and Montanari, U. (2005) Observing reductions in nominal calculi via a graphical encoding of processes. In: Middeldorp, A., van Oostrom, V., van Raamsdonk, F. and de Vrijer, R. (eds.) Processes, terms and cycles (Klop Festschrift). Springer-Verlag Lecture Notes in Computer Science 3838 106–126.Google Scholar
Gordon, A. and Cardelli, L. (2003) Equational properties of mobile ambients. Mathematical Structures in Computer Science 13 (3)371–408.Google Scholar
Lack, S. and Sobocinski, P. (2005) Adhesive and quasiadhesive categories. Theoretical Informatics and Applications 39 (3)511–545.Google Scholar
Leifer, J. and Milner, R. (2000) Deriving bisimulation congruences for reactive systems. In: Palamidessi, C. (ed.) Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 1877 243–258.Google Scholar
Merro, M. and Zappa Nardelli, F. (2005) Behavioral theory for mobile ambients. Journal of ACM 52 (6)961–1023.Google Scholar
Milner, R. (1989) Communication and Concurrency, Prentice Hall.Google Scholar
Milner, R. (1999) Communicating and Mobile Systems: the π-Calculus, Cambridge University Press.Google Scholar
Milner, R. (2006) Pure bigraphs: Structure and dynamics. Information and Computation 204 (1)60–122.Google Scholar
Rathke, J. and Sobociński, P. (2008a) Deconstructing behavioural theories of mobility. In: Ausiello, G., Karhumäki, J., Mauri, G. and Ong, L. (eds.) IFIP International Conference on Theoretical Computer Science. IFIP Advances in Information and Communication Technology 273 507–520.Google Scholar
Rathke, J. and Sobociński, P. (2008b) Deriving structural labelled transitions for mobile ambients. In: van Breugel, F. and Chechik, M. (eds.) Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 5201 462–476.Google Scholar
Rathke, J. and Sobocinski, P. (2010) Deriving structural labelled transitions for mobile ambients. Information and Computation 208 (10)1221–1242.CrossRefGoogle Scholar
Sassone, V. and Sobocinski, P. (2005) Reactive systems over cospans. In: Logic in Computer Science, IEEE Computer Society 311–320.Google Scholar
Sobociński, P. (2004) Deriving bisimulation congruences from reduction systems, Ph.D. thesis, BRICS, Department of Computer Science, University of Aarhus.Google Scholar