Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The reflexive CHAM and the join-calculus
POPL '96 Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Distributed Algorithms
Modern Concurrency Abstractions for C#
ECOOP '02 Proceedings of the 16th European Conference on Object-Oriented Programming
Orchestrating Transactions in Join Calculus
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Jocaml: Mobile Agents for Objective-Caml
ASAMA '99 Proceedings of the First International Symposium on Agent Systems and Applications Third International Symposium on Mobile Agents
Electronic Notes in Theoretical Computer Science (ENTCS)
Dreams: a framework for distributed synchronous coordination
Proceedings of the 27th Annual ACM Symposium on Applied Computing
| Hi-index | 0.00 |
We present a prototype application for coordinating distributed agreements in multi-parties negotiations, where participants can dynamically join ongoing negotiations and where participants know only those parties they have interacted with. Our prototype is tailored to Ad-Hoc network scenarios involving the assignment of tasks for a rescue team operating over disaster areas. Our application is based on asynchronous communication and it exploits the d2pc protocol for committing or aborting a negotiation. Parties have been developed both in Jocaml+Perl and Polyphonic C^@?. The implementation of the commit protocol allows components of both types to participate within the same negotiation.