Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
Testing equivalence for mobile processes
Information and Computation
On reduction-based process semantics
Selected papers of the thirteenth conference on Foundations of software technology and theoretical computer science
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
Theoretical Computer Science
Theoretical Computer Science
Trace and testing equivalence on asynchronous processes
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
The m-calculus: a higher-order distributed process calculus
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Finite State Verification for the Asynchronous pi-Calculus
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
From Rewrite to Bisimulation Congruences
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th 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
Interactive Mobile Agents in X-Klaim
WETICE '98 Proceedings of the 7th Workshop on Enabling Technologies: Infrastructure for Collaborative Enterprises
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
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
Bisimulation proof methods for mobile ambients
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Global computing in a dynamic network of tuple spaces
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Basic observables for a calculus for global computing
Information and Computation
A theory of system behaviour in the presence of node and link failure
Information and Computation
A calculus for mobile ad hoc networks
COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
Bigraphical models of context-aware systems
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
A mobility calculus with local and dependent types
Processes, Terms and Cycles
Safety versus security in the quality calculus
Theories of Programming and Formal Methods
Hi-index | 0.00 |
We introduce a foundational language for modelling applications over global computers whose interconnection structure can be explicitly manipulated. Together with process distribution, mobility, remote operations and asynchronous communication through distributed data spaces, the language provides constructs for explicitly modelling inter-node connections and for dynamically establishing and removing them. For the proposed language, we define natural notions of extensional observations and study their closure under operational reductions and/or language contexts to obtain barbed congruence and may testing equivalence. For such equivalences, we provide alternative characterizations in terms of a labelled bisimulation and a trace equivalence that can be used for actual proofs.