A multiparty interaction is a set of I/O actions executed jointly by a number of processes, each of which must be ready to execute its own action for any of the actions in the set to occur. An attempt to participate in an interaction delays a process until all other participants are available. Although a relatively new concept, the multiparty interaction has found its way into a number of distributed programming languages and algebraic models of concurrency. In this paper, we present a taxonomy of languages for multiparty interaction that covers all proposals of which we are aware. Based on this taxonomy, we then present a comprehensive analysis of the computational complexity of the multiparty interaction scheduling problem, the problem of scheduling multiparty interactions in a given execution environment. 1
|
7708
|
Computers and Intractability: A Guide to the Theory of NP-Completeness
– Garey, Johnson
- 1979
|
|
2807
|
Communication and Concurrency
– Milner
- 1989
|
|
2749
|
Communicating Sequential Processes
– Hoare
- 1985
|
|
372
|
Introduction to the ISO specification language LOTOS
– Bolognesi, Brinksma
- 1989
|
|
254
|
Calculi for synchrony and asynchrony
– Milner
- 1983
|
|
94
|
The Box Calculus; A new causal algebra with multi-label communication
– Best, Devilliers, et al.
- 1992
|
|
81
|
Distributed cooperation with action systems
– Back, Kurki-Suonio
- 1988
|
|
45
|
A proof system for communicating sequential processes
– Apt, Francez, et al.
- 1980
|
|
42
|
CIRCAL and the Representation of Communication, Concurrency, and Time
– Milne
- 1985
|
|
38
|
Appraising fairness in languages for distributed programming
– Apt, Francez, et al.
- 1988
|
|
29
|
Process synchronization: Design and performance evaluation of distributed algorithms
– Bagrodia
- 1989
|
|
29
|
Interacting Processes: A Multiparty Approach to Coordinated Distributed Programming
– Francez, Forman
- 1996
|
|
25
|
The Multiway Rendezvous
– Charlesworth
- 1987
|
|
17
|
Script: a Communication Abstraction Mechanism
– Francez, Hailpern, et al.
- 1986
|
|
16
|
An O( p jV j \Delta jEj) algorithm for finding maximum matching in general graphs
– Micali, Vazirani
- 1980
|
|
15
|
On the Design of Extended LOTOS, a Specification Language for Open Distributed Systems
– Brinksma
- 1988
|
|
15
|
An implementation of N-party synchronization using tokens
– Kumar
- 1990
|
|
15
|
A new and efficient implementation of multiprocess synchronization
– Ramesh
- 1987
|
|
14
|
of Defense. Reference Manual for the Ada Programming Language
– Department
- 1983
|
|
13
|
Coordinating first-order multiparty interactions
– Joung, Smolka
- 1994
|
|
13
|
A distributed synchronization scheme for fair multi-process handshakes
– Park, Kim
- 1990
|
|
13
|
Higher-level synchronizing devices in meije-sccs
– Simone
- 1985
|
|
11
|
Fairness and hyperfairness in multi-party interactions
– Attie, Francez, et al.
- 1993
|
|
11
|
On the design of large distributed systems
– Forman
- 1986
|
|
7
|
On fairness as an abstraction for the design of distributed systems
– Attie, Forman, et al.
- 1990
|
|
5
|
Interacting processes: a language for coordinated distributed programming
– Francez, Forman
- 1990
|
|
3
|
A new class of high-level programs for distributed computing systems
– Ramesh, Mehndiratta
- 1985
|
|
2
|
Parallel Program Design.Addison-Wesley Publishing Company
– Chandy, Misra
- 1988
|
|
2
|
Distributed implementation of LOTOS multi-rendezvous
– Gao, Bochmann
- 1989
|
|
2
|
Occam Programming Manual
– Hoare
- 1984
|
|
2
|
A completely distributed and message-efficient implementation of synchronous multiprocess communication
– Joung, Smolka
- 1990
|
|
2
|
Efficient, dynamically structured multiprocess communication
– Joung, Smolka
- 1990
|
|
2
|
Multifaceted distributed systems specification using processes and event synchronization
– Roman, Day
- 1984
|
|
