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
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
Mathematical Structures in Computer Science
A Coalgebraic Approach to Process Equivalence and a Coinduction Principle for Traces
Electronic Notes in Theoretical Computer Science (ENTCS)
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
Hi-index | 0.00 |
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 work towards a unifying coalgebraic framework for the denotational semantics of mobile systems. The connection between the ambient calculus and a coalgebraic approach which uses an extension of labelled transition systems in the representation of the reduction relation is analyzed in more detail. The formal representation of this framework is cast in the algebraic-coalgebraic specification language CoCasl.