A calculus of mobile processes, I
Information and Computation
The lazy Lambda calculus in a concurrency scenario
Information and Computation
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
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Communication and Concurrency
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
TACS '01 Proceedings of the 4th International Symposium on Theoretical Aspects of Computer Software
Replication in Concurrent Combinators
TACS '94 Proceedings of the International Conference on Theoretical Aspects of Computer Software
ICALP '92 Proceedings of the 19th 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
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Communication and mobility control in boxed ambients
Information and Computation
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
The kell calculus: a family of higher-order distributed process calculi
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
Behavioral theory for mobile ambients
Journal of the ACM (JACM)
Safe ambients: abstract machine and distributed implementation
Science of Computer Programming
Leader election in rings of ambient processes
Theoretical Computer Science - Expressiveness in concurrency
Boxed ambients with communication interfaces
Mathematical Structures in Computer Science
Simulations Up-to and Canonical Preorders
Electronic Notes in Theoretical Computer Science (ENTCS)
Deriving Structural Labelled Transitions for Mobile Ambients
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
(Bi)simulations up-to characterise process semantics
Information and Computation
Mobility control via passports
Information and Computation
On the Relative Expressive Power of Ambient-Based Calculi
Trustworthy Global Computing
Types for role-based access control of dynamic web data
WFLP'10 Proceedings of the 19th international conference on Functional and constraint logic programming
More on bisimulations for higher order π-calculus
Theoretical Computer Science
Mobility control via passports
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Hi-index | 0.00 |
We develop a semantics theory for SAP, a variant of Levi and Sangiorgi's Safe Ambients, SA.The dynamics of SA relies upon capabilities (and co-capabilities) exercised by mobile agents, called ambients, to interact with each other. These capabilities contain references, the names of ambients with which they wish to interact. In SAP we generalize the notion of capability: in order to interact with an ambient n, an ambient m must exercise a capability indicating both n and a password h to access n; the interaction between n and m takes place only if n is willing to perform a corresponding co-capability with the same password h. The name h can also be looked upon as a port to access ambient n via port h.In SAP, by managing passwords/ports, for example generating new ones and distributing them selectively, an ambient may now program who may migrate into its computation space, and when. Moreover in SAP, an ambient may provide different services/resources depending on the port accessed by the incoming clients. Then we give an lts-based operational semantics for SAP and a labelled bisimulation equivalence, which is proved to coincide with reduction barbed congruence.We use our notion of bisimulation to prove a set of algebraic laws that are subsequently exploited to prove more significant examples.