A comprehensive study of the complexity of multiparty interaction

DOI10.1145/227595.227601MaRDI QIDQ4371516zbMATH OpenOpenAlexFDO

Authors Yuh-Jzer Joung, Scott A. Smolka

Publication date 19 January 1998

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL http://www.acm.org/pubs/contents/journals/jacm/1996-43/

zbMATH Keywords

multiparty interaction schedulingtaxonomy

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of operating systems (68N25)

Recommendations

• Distributed implementation of systems with multiparty interactions and priorities
• Open Multiparty Interaction
• scientific article; zbMATH DE number 839543
• Local planning of multiparty interactions with bounded horizons

Cited in

(7)

• Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability
• A formal approach to open multiparty interactions
• On fairness notions in distributed systems. I: A characterization of implementability
• Local planning of multiparty interactions with bounded horizons
• Distributed implementation of systems with multiparty interactions and priorities
• scientific article; zbMATH DE number 2087406 (Why is no real title available?)
• scientific article; zbMATH DE number 839543 (Why is no real title available?)

Describes a project that uses

Uses Software

• LOTOS

This page was built for publication: A comprehensive study of the complexity of multiparty interaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4371516)