by Daniel Hausmann, Till Mossakowski and Lutz Schröder
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.
Reference:
Daniel Hausmann, Till Mossakowski and Lutz Schröder: A Coalgebraic Approach to the Semantics of the Ambient Calculus, In Theoretical Computer Science, 366(1-2), pp. 121–143, 2006. Extends (Hausmann et al. 2005) [preprint]
Bibtex Entry:
@Article{HausmannEA06,
author = {Daniel Hausmann and Till Mossakowski and Lutz Schr{\"o}der},
title = {A Coalgebraic Approach to the Semantics of the Ambient Calculus},
year = {2006},
journal = {Theoretical Computer Science},
volume = {366},
pages = {121-143},
number = {1-2},
keywords = {ambient calculus coalgebra cocasl corecursion bialgebra},
url = {http://dx.doi.org/10.1016/j.tcs.2006.07.006},
comment = { <a href = "http://www8.informatik.uni-erlangen.de/~schroeder/papers/mobility-ext.pdf"> [preprint] </a>},
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.
},
note = {Extends (Hausmann et al. 2005)},
}