A comprehensive study of the complexity of multiparty interaction

DOI10.1145/227595.227601zbMath0882.68036OpenAlexW2054099113MaRDI QIDQ4371516

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

taxonomymultiparty interaction scheduling

Mathematics Subject Classification ID

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

Related Items (3)

A formal approach to open multiparty interactions ⋮ Two decentralized algorithms for strong interaction fairness for systems with unbounded speed variability ⋮ On fairness notions in distributed systems. I: A characterization of implementability

Uses Software

• LOTOS

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