Yuh-Jzer Joung
- ANDREWS, G. R., OLSSON, R. A., COFFZN, M., ELSHOFF, I., NILSEN, K., PURDIN, T., AND TOWNSEND, G. 1988. An overview of the SR language and implementation. ACM Trans. Prog. Lang. Syst. 10, 1 (Jan.), 51-86. Google Scholar
- AFT, K. R., FRANCEZ, N., AND DE ROEVER, W. P. 1980. A proof system for communicating sequential processes. ACM Trans. Prog. Lang. Syst. 2, 3 (July), 359-380. Google Scholar
- APT, K. R., FRANCEZ, N., AND KATZ, S. 1988. Appraising fairness in languages for distributed programming. Dist. Comput. 2, 4, 226-241.Google Scholar
- ATTIE, P. C., FORMAN, I. R., AND LEVY, E. 1990. On fairness as an abstraction for the design of distributed systems. In Proceech'ngs of the l Oth International Conference on Distributed Computing Systems (Paris, France). IEEE Computer Society Press, Los Alamitos, Calif., pp. 150-157.Google Scholar
- ATTIE, P. C., FRANCEZ, N., AND GRUMBERG, O. 1993. Fairness and hyperfaimess in multi-party interactions. D/st. Comput. 6, 245-254. Google Scholar
- BAcg, R. J. R., At~'O KURrd-SUONIO, R. 1988. Distributed cooperation with action systems. ACM Trans. Prog. Lang. Syst. 10, 4 (Oct.), 513-554. Google Scholar
- BAGRODIA, R. 1989. Process synchronization: Design and performance evaluation of distributed algorithms. IEEE Trans. Softw. Eng. SE-15, 9 (Sept.), 1053-1065. Google Scholar
- BEST, E., DE,LEERS, R., AND HALL, J. G. 1992. The box calculus: A new causal algebra with multi-label communication. In Advances in Petri Nets, G. Rozenberg, ed., Lecture Notes in Computer Science, vol. 609. Springer-Verlag, New York, pp. 21-87. Google Scholar
- BOLOGNESI, T., AND BRINKSMA, E. 1987. Introduction to the ISO specification language LOTOS. Comput. Netw. ISDN Syst. 14, 25-59. Google Scholar
- BRINKSMA, E. 1988. On the Design of Extended LOTOS~A Specification Language for Open Distributed Systems. Ph.D. dissertation. Univ. Twente, the Netherlands.Google Scholar
- CHARLESWORTH, A. 1987. The multiway rendezvous. ACM Trans. Prog. Lang. Syst. 9, 3 (July), 350-366. Google Scholar
- CHANDY, K. M., AND MISRA, J. 1988. A Foundation of Parallel Program Design. Addison-Wesley, Reading, Mass. Google Scholar
- COFFIN, M., AND OLSSON, R. A. 1989. An SR approach to multiway rendezvous. Comput. Lang. 14, 4, 255-262.Google Scholar
- DE SIMONE, R. 1985. Higher-level synchronizing devices in MEIJE-SCCS. Theoret. Comput. Sci. 37, 245-267.Google Scholar
- EVANGELIST, M., FRANCEZ, N., AND KATZ, S. 1989. Multiparty interactions for interprocess communication and synchronization. IEEE Trans. Softw. Eng. SE-15, 11 (Nov.), 1417-1426. Google Scholar
- FEITELSON, D. G. 1991. Communicators: Object-Based multiparty interactions for parallel programming. Tech. Rep. 91-12. Department of Computer Science, The Hebrew University of Jerusalem, Jerusalem, Israel.Google Scholar
- FORMA_~, I. R. 1986. On the design of large distributed systems, in Proceedings of the 1st International Conference on Computer Languages (Miami, Fla., Oct.) IEEE Computer Society Press, Washington, D.C., pp. 84-95.Google Scholar
- FRANCEZ, N. 1986. Fairness. Springer-Verlag, New York. Google Scholar
- FRA~CEZ, N. 1989. Cooperating proofs for distributed programs with multi-party interactions. Inf. Proc. Lett. 32, 5 (Sept.), 235-242. Google Scholar
- FRANCEZ, N., AND FORMAN, I. R. 1990. Interacting Processes: Coordinated distributed programming. Tech. Rep. STP-226-90. Microelectronics and Computer Technology Corp., Austin, Texas.Google Scholar
- FRANCE7., N., AND FORMAN, I. R. 1995. Interacting Processes: A Multiparty Approach to Coordinated Distributed tS'ogramming. Addison-Wesley, Reading, Mass. Google Scholar
- FRA~CEZ, N., HAILPERN, B., AND TAUBENFELD, G. 1986. Script: A communication abstraction mechanism. Sci. Comput. Prog. 6, 1 (Jan.), 35-88. Google Scholar
- GAO, Q., AND BOCHMAr~, G. V. 1989. Distributed implementation of LOTOS multi-rendezvous. In Participants Proceedings of the 9th IFIP WG 6.1 International Symposium on Protocol Specification, Testing, and Verification, E. Brinksma, G. Scollo, and C. A. Vissers, eds. University of Twente, Twente, the Netherlands.Google Scholar
- GAREY, M. R., AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to The Theory of NP-completeness. Freeman, San Francisco, Calif. Google Scholar
- GELERm'ER, D. 1985. Generative communication in Linda. ACM Trans. Prog. Lang. Syst. 7, 1 (Jan.), 80-112. Google Scholar
- GERMAN, S. M. 1992. Programming in a general model of synchronization. In Proceedings of CONCUR '92--Third International Conference on Concurrency Theory, W. R. Cleaveland, ed., Lecture Notes in Computer Science, vol. 630. Springer-Verlag, New York, pp. 534-549. Google Scholar
- HOARE, C. A. R. 1978. Communicating sequential processes. Commun. ACM 21, 8 (Aug.), 666-677. Google Scholar
- HOARE, C. A. R. 1984. Occam Programming Manual. Prentice-Hall, Englewood Cliffs, NJ. Google Scholar
- HOARE, C. A. R. 1985. Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs, NJ. Google Scholar
- JANtCra, R., AND LAUER, P. E. 1992. Specification and analysis of concurrent systems: The COSY approach. In EATCS Monographs on Theoretical Computer Science, W. Brauer, G. Rozenberg, and A. Salomaa, eds. Springer-Verlag, New York.Google Scholar
- JARVINEN, H.-M., AND KURKI-SUONIO, R. 1991. DisCo specification language: Marriage of actions and objects. In Proceedings of the l lth International Conference on Distributed Computing Systems (Arlington, Tex., May). IEEE Computer Society Press, New York, pp. 142-151.Google Scholar
- J~,RViNEN, H.-M., KURFd-SUONIO, R., SAKKJNEN, M., AND SYST~, K. 1990. Object-oriented specification of reactive systems, in Proceedings of the 12th International Conference on Software Engineering (Nice, France, Mar.). IEEE Computer Society Press, New York, pp. 63-71. Google Scholar
- JOUNG, Y.-J. 1992. On the design and implementation of multiparty interaction. Ph.D. dissertation. Department of Computer Science, State University of New York at Stony Brook, New York, May. Google Scholar
- JOUNG, Y.-J., AND SMOLKA, S. A. 1990a. A completely distributed and message-efficient implementation of synchronous multiprocess communication. In Proceedings of the 19th International Conference on Parallel Processing (Aug.). Penn State Press, University Park, Pa., pp. III:311-318.Google Scholar
- JOUNG, Y.-J., AND SMOLKA, S. A. 1990b. Efficient, dynamically structured multiprocess communication. In Proceedings of the 28th Annual Allerton Conference on Communication, Control, and Computing (Monticello, Ill., Oct. 3-5). Allerton House, Ill.Google Scholar
- JOUNG, Y.-J., AND SMOLKA, S. A. 1994. Coordinating first-order multiparty interactions. ACM Trans. Prog. Lang. Syst. 16, 3 (May), 954-985. Google Scholar
- KUMAR, D. 1990. An implementation of N-party synchronization using tokens. In Proceedings of the lOth International Conference on Distributed Computing Systems (Paris, France, May 28-June 1). IEEE Computer Society Press, Los Alamitos, Calif.Google Scholar
- MILNE, G. J, 1985. CIRCAL and the representation of communication, concurrency, and time. ACM Trans. Prog. Lang. Syst. 7, 2 (Apr.), 270-289. Google Scholar
- MILNER, R. 1983. Calculi for synchrony and asynchrony. Theoret. Comput. Sci. 25, 267-310.Google Scholar
- MtLNER, R. 1989. Communication and Concurrency. International Series in Computer Science. Prentice-Hall, London, United Kingdom. Google Scholar
- MICALI, S., AND VAZIRANI, V, V. 1980. An O(lvll/2.1e{) algorithm for finding maximum matching in general graphs. In Proceedings of the 21st Annual IEEE Symposium on Foundations of Computer Science (Long Beach, Calif.). IEEE, New York, pp. 17-21.Google Scholar
- PAgK, M. H., AND KaM, M. 1990. A distributed synchronization scheme for fair multi-process handshakes. Inf. Proc. Lett. 34, (Apr.), 131-138. Google Scholar
- RAMESH, S. 1987, A new and efficient implementation of multiprocess synchronization. In Proceedings of the Conference on Parallel Architecture and Languages Europe (PARLE). Lecture Notes in Computer Science, vol. 259. Springer-Verlag, Berlin, Germany, pp. 387-401. Google Scholar
- RAMESH, S., AND MEHNDIRATTA, S. L 1985. A new class of high-level programs for distributed computing systems. In Proceedings of the 5th Conference on FST-TCS. Lecture Notes in Computer Science, vol. 206. Springer-Verlag, Berlin, Germany, pp. 42-72. Google Scholar
- ROMAN, G.-C., AND DAY, M. S. 1984. Multifaceted distributed systems specification using processes and event synchronization. In Proceedings of the 7th International Conference on Software Engineering (Orlando, Fl., Mar.), pp. 44-55. Google Scholar
- TSAY, Y.-K., AND BAGRODIA, R. L. 1993. Some impossibility results in interprocess synchronization. Distrib. Comput. 6, 4, 221-231. Google Scholar
Index Terms
- A comprehensive study of the complexity of multiparty interaction
Recommendations
Human-robot collaborative tutoring using multiparty multimodal spoken dialogue
HRI '14: Proceedings of the 2014 ACM/IEEE international conference on Human-robot interactionIn this paper, we describe a project that explores a novel experimental setup towards building a spoken, multi-modally rich, and human-like multiparty tutoring robot. A human-robot interaction setup is designed, and a human-human dialogue corpus is ...
Facilitating multiparty dialog with gaze, gesture, and speech
ICMI-MLMI '10: International Conference on Multimodal Interfaces and the Workshop on Machine Learning for Multimodal InteractionWe study how synchronized gaze, gesture and speech rendered by an embodied conversational agent can influence the flow of conversations in multiparty settings. We begin by reviewing a computational framework for turn-taking that provides the foundation ...
Multimodal multiparty social interaction with the furhat head
ICMI '12: Proceedings of the 14th ACM international conference on Multimodal interactionWe will show in this demonstrator an advanced multimodal and multiparty spoken conversational system using Furhat, a robot head based on projected facial animation. Furhat is a human-like interface that utilizes facial animation for physical robot heads ...
Reviews
Pradip K. Srimani
In designing distributed systems, protocols and language primitives are needed to implement different synchronization requirements, among other things. Multiparty interaction is a relatively recent concept of a set of I/O operations to be executed jointly by multiple participating processes, such that each participant must be ready to execute its own actions for any of the actions in the set to occur. This concept has already been adopted in many distributed programming languages. There are many interesting design decisions to be made (such as the arity of interactions, fixed versus dynamic participation, conjunctive versus disjunctive parallelism, and synchronous versus asynchronous operation) in implementing multiparty interaction. Different languages have adopted different approaches, each with its own advantages and disadvantages. The purpose of this paper is twofold: to provide an exhaustive taxonomy of the topic, and to develop a unified comprehensive complexity analysis of the multiparty interaction scheduling problem. The general taxonomy of the languages is based on the four basic constructs: channels, ports, gates, and teams. One interesting and promising outcome of the comprehensive complexity analysis is that many further improvements in flexibility and parallelism are possible without sacrificing tractability. Both purposes are achieved. The paper is extremely well written; it is more or less self-contained, reads well, and provides all of the important results in one place. A fairly exhaustive bibliography enhances its usefulness. The paper is a must read for anybody who wants to know about the topic or the related open research problems. It constitutes a valuable contribution to the general theory of distributed computing.
Access critical reviews of Computing literature here
Become a reviewer for Computing Reviews.
Comments