Skip to main navigation Skip to search Skip to main content

Comprehensive study of the complexity of multiparty interaction (Extended abstract)

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We present a taxonomy of languages for multiparty interaction, which covers all proposals of which we are aware. Based on this taxonomy, we present a comprehensive analysis of the computational complexity of the multiparty interaction implementation problem, the problem of scheduling multiparty interactions in a given execution environment.

Original languageEnglish
Title of host publicationConference Record of the Annual ACM Symposium on Principles of Programming Languages
Editors Anon
PublisherPubl by ACM
Pages142-153
Number of pages12
ISBN (Print)0897914538
StatePublished - 1992
Event19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages - Albuquerque, NM, USA
Duration: Jan 19 1992Jan 22 1992

Publication series

NameConference Record of the Annual ACM Symposium on Principles of Programming Languages
ISSN (Print)0730-8566

Conference

Conference19th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
CityAlbuquerque, NM, USA
Period01/19/9201/22/92

Fingerprint

Dive into the research topics of 'Comprehensive study of the complexity of multiparty interaction (Extended abstract)'. Together they form a unique fingerprint.

Cite this