Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
A calculus of mobile processes, I
Information and Computation
Bisimulation for higher-order process calculi
Information and Computation
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
On the expressiveness of internal mobility in name-passing calculi
Theoretical Computer Science
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Trust and partial typing in open systems of mobile agents
Proceedings of the 26th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the expressiveness of Linda coordination primitives
Information and Computation - Special issue on EXPRESS 1997
What is a “good” encoding of guarded choice?
Information and Computation - Special issue on EXPRESS 1997
Comparing three semantics for Linda-like languages
Theoretical Computer Science
Theoretical Computer Science
Information and Computation
Resource access control in systems of mobile agents
Information and Computation
PI-Calculus: A Theory of Mobile Processes
PI-Calculus: A Theory of Mobile Processes
An Object Calculus for Asynchronous Communication
ECOOP '91 Proceedings of the European Conference on Object-Oriented Programming
On Synchronous and Asynchronous Communication Paradigms
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Graph Types for Monadic Mobile Processes
Proceedings of the 16th Conference 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
KLAVA: a Java package for distributed and mobile applications
Software—Practice & Experience
Comparing the expressive power of the synchronous and asynchronous $pi$-calculi
Mathematical Structures in Computer Science
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Resource access and mobility control with dynamic privileges acquisition
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Basic observables for a calculus for global computing
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Pattern matching over a dynamic network of tuple spaces
FMOODS'05 Proceedings of the 7th IFIP WG 6.1 international conference on Formal Methods for Open Object-Based Distributed Systems
Global computing in a dynamic network of tuple spaces
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
Mobile distributed programming in X-KLAIM
SFM-Moby'05 Proceedings of the 5th international conference on Formal Methods for the Design of Computer, Communication, and Software Systems: mobile computing
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
Global computing in a dynamic network of tuple spaces
Science of Computer Programming
Synchrony vs Asynchrony in Communication Primitives
Electronic Notes in Theoretical Computer Science (ENTCS)
Basic observables for a calculus for global computing
Information and Computation
Separation of synchronous and asynchronous communication via testing
Theoretical Computer Science
Comparing communication primitives via their relative expressive power
Information and Computation
On the Relative Expressive Power of Calculi for Mobility
Electronic Notes in Theoretical Computer Science (ENTCS)
Languages and process calculi for network aware programming – short summary -
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Orchestrating tuple-based languages
TGC'11 Proceedings of the 6th international conference on Trustworthy Global Computing
Network Conscious π-calculus: A Concurrent Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Securely accessing shared resources with concurrent constraint programming
SEFM'12 Proceedings of the 10th international conference on Software Engineering and Formal Methods
| Hi-index | 0.00 |
We study the expressive power of variants of KLAIM, an experimental language with programming primitives for network-aware programming that combines the process algebra approach with the coordination-oriented one. KLAIM has proved to be suitable for programming a wide range of distributed applications with agents and code mobility, and has been implemented on the top of a runtime system written in Java. In this paper, the expressivity of its constructs is tested by distilling from it a few, more and more foundational, languages and by studying the encoding of each of them into a simpler one. The expressive power of the considered calculi is finally tested by comparing one of them with asynchronous π-calculus.