On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
Bisimulation for higher-order process calculi
Information and Computation
A typed language for distributed mobile processes (extended abstract)
POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Controlling interference in ambients
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Theoretical Computer Science
Nomadic pict: correct communication infrastructure for mobile computation
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Extensionality and intensionality of the ambient logics
POPL '01 Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Bisimulation congruences in safe ambients
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
A Hierarchy of Equivalences for Asynchronous Calculi
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
A LTS Semantics of Ambients via Graph Synchronization with Mobility
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
A Calculus of Mobile Resources
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
The Problem of ``Weak Bisimulation up to''
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
The Seal Calculus Revisited: Contextual Equivalence and Bisimilarity
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Communication Interference in Mobile Boxed Ambients
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Equational properties of mobile ambients
Mathematical Structures in Computer Science
On the bisimulation proof method
Mathematical Structures in Computer Science
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Towards a behavioural theory of access and mobility control in distributed systems
Theoretical Computer Science - Special issue: Foundations of wide area network computing
Profunctors, open maps and bisimulation
Mathematical Structures in Computer Science
Information and Computation
Communication and mobility control in boxed ambients
Information and Computation
Pure bigraphs: structure and dynamics
Information and Computation
Name-passing in an ambient-like calculus and its proof using spatial logic
Theoretical Computer Science - Expressiveness in concurrency
Minimization Algorithm for Symbolic Bisimilarity
ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Communication and mobility control in boxed ambients
Information and Computation
Information and Computation
Pure bigraphs: Structure and dynamics
Information and Computation
Coalgebraic symbolic semantics
CALCO'09 Proceedings of the 3rd international conference on Algebra and coalgebra in computer science
Concurrency can't be observed, asynchronously
APLAS'10 Proceedings of the 8th Asian conference on Programming languages and systems
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Proof methodologies for behavioural equivalence in DPI
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
| Hi-index | 0.00 |
We study the behavioural theory of Cardelli and Gordon's Mobile Ambients. We give an LTS based operational semantics, and a labelled bisimulation based equivalence that coincides with reduction barbed congruence. We also provide up-to proof techniques and prove a set of algebraic laws, including the perfect firewall equation.