Generative communication in Linda
ACM Transactions on Programming Languages and Systems (TOPLAS)
More choices allow more faults: set consensus problems in totally asynchronous systems
Information and Computation
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
KLAIM: A Kernel Language for Agents Interaction and Mobility
IEEE Transactions on Software Engineering
On bisimulations of the asynchronous &pgr;-calculus
Theoretical Computer Science
Proceedings of the 21st international conference on Software engineering
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
Trace and testing equivalence on asynchronous processes
Information and Computation
Resource access control in systems of mobile agents
Information and Computation
JavaSpaces Principles, Patterns, and Practice
JavaSpaces Principles, Patterns, and Practice
Reasoning about Cryptographic Protocols in the Spi Calculus
CONCUR '97 Proceedings of the 8th International Conference on Concurrency Theory
CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
The Mobility Workbench - A Tool for the pi-Calculus
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
IBM Systems Journal
Formal modeling and quantitative analysis of KLAIM-based mobile systems
Proceedings of the 2005 ACM symposium on Applied computing
A theory of system behaviour in the presence of node and link failures
CONCUR 2005 - Concurrency Theory
On the expressive power of KLAIM-based calculi
Theoretical Computer Science - Expressiveness in concurrency
A process calculus for qos-aware applications
COORDINATION'05 Proceedings of the 7th international conference on Coordination Models and Languages
A theory of system behaviour in the presence of node and link failure
Information and Computation
| Hi-index | 0.00 |
We present tKlaim (TopologicalKlaim), a process description language that retains the main features of Klaim (process distribution and mobility, remote and asynchronous communication through distributed data spaces), but extends it with new constructs to flexibly model the interconnection structure underlying a network and its evolution in time. We show how tKlaim can be used to model a number of interesting distributed applications and how systems correctness can be guaranteed, also in the presence of failures, by exploiting observational equivalences to study the relationships between descriptions of systems at different levels of abstraction.