A distributed algorithm to implement n-party rendezvous
Proc. of the seventh conference on Foundations of software technology and theoretical computer science
Synchronization of asynchronous processes in CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Process Synchronization: Design and Performance Evaluation of Distributed Algorithms
IEEE Transactions on Software Engineering
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
Using MPI (2nd ed.): portable parallel programming with the message-passing interface
MPI: The Complete Reference
Hierarchical ordering of sequential processes
The origin of concurrent programming
An order-based algorithm for implementing multiparty synchronization: Research Articles
Concurrency and Computation: Practice & Experience
Distributed Semantics and Implementation for Systems with Interaction and Priority
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Priority Scheduling of Distributed Systems Based on Model Checking
CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Capturing conflict and confusion in CSP
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
Knowledge based scheduling of distributed systems
Time for verification
Adding conflict and confusion to CSP
FM'05 Proceedings of the 2005 international conference on Formal Methods
Achieving distributed control through model checking
CAV'10 Proceedings of the 22nd international conference on Computer Aided Verification
| Hi-index | 0.00 |
Rich interaction models are a powerful mechanism allowing to synchronize several entities in order to achieve some common goal and to specify global properties in an abstract manner. In this paper we focus on two types of interaction models, namely multiparty interactions and priorities where priorities may be used to specify different scheduling policies. We propose a protocol for building distributed implementation of component-based models with multiparty interactions and priorities. We also present a set of experiments providing a performance analysis of the protocol.