Recently, various process calculi have been introduced which are suited
for the modelling of mobile computation and in particular the mobility
of program code; a prominent example is the ambient calculus. Due to the
complexity of the involved spatial reduction, there is --- in contrast
to the situation in standard process algebra --- up to now no satisfying
coalgebraic representation of a mobile process calculus. Here, we
discuss a coalgebraic denotational semantics for the ambient calculus,
viewed as a step towards a generic coalgebraic framework for modelling
mobile systems. Crucial features of our modelling are a set of GSOS
style transition rules for the ambient calculus, a hardwiring of the
so-called hardening relation in the functorial signature, and a
set-based treatment of hidden name sharing. The formal representation
of this framework is cast in the algebraic-coalgebraic specification
language CoCASL.
%0 Journal Article
%1 HausmannEA06
%A Hausmann, Daniel
%A Mossakowski, Till
%A Schröder, Lutz
%D 2006
%J Theoretical Computer Science
%K ambient bialgebra calculus coalgebra cocasl corecursion
%N 1-2
%P 121-143
%T A Coalgebraic Approach to the Semantics of the Ambient Calculus
%U http://dx.doi.org/10.1016/j.tcs.2006.07.006
%V 366
%X Recently, various process calculi have been introduced which are suited
for the modelling of mobile computation and in particular the mobility
of program code; a prominent example is the ambient calculus. Due to the
complexity of the involved spatial reduction, there is --- in contrast
to the situation in standard process algebra --- up to now no satisfying
coalgebraic representation of a mobile process calculus. Here, we
discuss a coalgebraic denotational semantics for the ambient calculus,
viewed as a step towards a generic coalgebraic framework for modelling
mobile systems. Crucial features of our modelling are a set of GSOS
style transition rules for the ambient calculus, a hardwiring of the
so-called hardening relation in the functorial signature, and a
set-based treatment of hidden name sharing. The formal representation
of this framework is cast in the algebraic-coalgebraic specification
language CoCASL.
@article{HausmannEA06,
abstract = {Recently, various process calculi have been introduced which are suited
for the modelling of mobile computation and in particular the mobility
of program code; a prominent example is the ambient calculus. Due to the
complexity of the involved spatial reduction, there is --- in contrast
to the situation in standard process algebra --- up to now no satisfying
coalgebraic representation of a mobile process calculus. Here, we
discuss a coalgebraic denotational semantics for the ambient calculus,
viewed as a step towards a generic coalgebraic framework for modelling
mobile systems. Crucial features of our modelling are a set of GSOS
style transition rules for the ambient calculus, a hardwiring of the
so-called hardening relation in the functorial signature, and a
set-based treatment of hidden name sharing. The formal representation
of this framework is cast in the algebraic-coalgebraic specification
language CoCASL.
},
added-at = {2016-08-05T15:59:03.000+0200},
author = {Hausmann, Daniel and Mossakowski, Till and Schr{\"o}der, Lutz},
biburl = {https://www.bibsonomy.org/bibtex/28d8a2b887b5166255b6296c0d2ba0c18/tillmo},
interhash = {e432f0f0d5e0de81d5c03f7d9ef84976},
intrahash = {8d8a2b887b5166255b6296c0d2ba0c18},
journal = {Theoretical Computer Science},
keywords = {ambient bialgebra calculus coalgebra cocasl corecursion},
note = {Extends (Hausmann et al. 2005)},
number = {1-2},
pages = {121-143},
pdfurl = {http://www.informatik.uni-bremen.de/~lschrode/papers/mobility-ext.pdf},
status = {Reviewed},
timestamp = {2016-08-05T15:59:03.000+0200},
title = {A Coalgebraic Approach to the Semantics of the Ambient Calculus},
url = {http://dx.doi.org/10.1016/j.tcs.2006.07.006},
volume = 366,
year = 2006
}