A coalgebraic approach to the semantics of the ambient calculus

Authors:
Daniel Hausmann;Till Mossakowski;Lutz Schröder
Affiliations:
Department of Computer Science, University of Bremen, Germany;Department of Computer Science, University of Bremen, Germany;Department of Computer Science, University of Bremen, Germany
Venue:
Theoretical Computer Science - Algebra and coalgebra in computer science
Year:
2006

Citing 14
Cited 4

A theory of higher order communicating systems

Information and Computation
Mobile ambients

Theoretical Computer Science
Universal coalgebra: a theory of systems

Theoretical Computer Science - Modern algebra and its applications
Bisimulation congruences in safe ambients

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Mobile safe ambients

ACM Transactions on Programming Languages and Systems (TOPLAS)
Barbed Bisimulation

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Final semantics for the pi-calculus

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Towards a Mathematical Operational Semantics

LICS '97 Proceedings of the 12th Annual IEEE Symposium on Logic in Computer Science
Equational properties of mobile ambients

Mathematical Structures in Computer Science
Generalised coinduction

Mathematical Structures in Computer Science
Behavioral theory for mobile ambients

Journal of the ACM (JACM)
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces

Electronic Notes in Theoretical Computer Science (ENTCS)
Iterative circular coinduction for CoCasl in isabelle/HOL

FASE'05 Proceedings of the 8th international conference, held as part of the joint European Conference on Theory and Practice of Software conference on Fundamental Approaches to Software Engineering
Expressivity of coalgebraic modal logic: the limits and beyond

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Expressivity of coalgebraic modal logic: The limits and beyond

Theoretical Computer Science
Coalgebraic modal logic in COCASL

WADT'06 Proceedings of the 18th international conference on Recent trends in algebraic development techniques
Coalgebraic symbolic semantics

CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
A coalgebraic approach to non-determinism: Applications to multilattices

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

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.