Fairness and hyperfairness in multi-party interactions

Authors:
Paul C. Attie;Nissim Francez;Orna Grumberg
Affiliations:
Department of Computer Sciences, The University of Texas at Austin and Microelectronics and Computer Technology Corporation, Austin, Texas;Microelectronics and Computer Technology Corporation, Austin, Texas and Computer Science Department, Technion, Haifa, Israel;Computer Science Department, Technion, Haifa, Israel
Venue:
Distributed Computing
Year:
1993

Citing 15
Cited 13

Communicating sequential processes

Communicating sequential processes
Script: a communication abstraction mechanism and its verification

Science of Computer Programming
Fairness

Fairness
The multiway rendezvous

ACM Transactions on Programming Languages and Systems (TOPLAS)
A Methodology for Developing Distributed Programs

IEEE Transactions on Software Engineering
Two normal form theorems for CSP programs

Information Processing Letters
Appraising fairness in distributed languages

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Fairness in parallel programs: the transformational approach

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed cooperation with action systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Parallel program design: a foundation

Parallel program design: a foundation
Cooperating proofs for distributed programs with multiparty interactions

Information Processing Letters
Communicating sequential processes

Communications of the ACM
A Discipline of Programming

A Discipline of Programming
Decentralization of process nets with centralized control

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Fair termination of communicating processes

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

A comprehensive study of the complexity of multiparty interaction

Journal of the ACM (JACM)
Strong Interaction Fairness Via Randomization

IEEE Transactions on Parallel and Distributed Systems
Probabilistic Unfoldings and Partial Order Fairness in Petri Nets

PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
An Algorithm for Ensuring Fairness and Liveness in Non-deterministic Systems Based on Multiparty Interactions

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Refinement-Robust Fairness

CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Action systems in incremental and aspect-oriented modeling

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Fairness and hyperfairness

Distributed Computing
Generating non-conspiratorial executions

Information Processing Letters
Fairness and conspiracy concepts in concurrent systems

ACM SIGSOFT Software Engineering Notes
Application of TLRO to dining philosophers problem

ACM SIGSOFT Software Engineering Notes
On conspiracies and hyperfairness in distributed computing

DISC'05 Proceedings of the 19th international conference on Distributed Computing
Defining Fairness in Reactive and Concurrent Systems

Journal of the ACM (JACM)
Model checking with fairness assumptions using PAT

Frontiers of Computer Science: Selected Publications from Chinese Universities

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a new fairness notion is proposed for languages with multi-party interactions as the sole interprocess synchronization and communication primitive. The main advantage of this fairness notion is the elimination of starvation occurring solely due to race conditions (i.e., ordering of independent actions). Also, this is the first fairness notion for such languages which is fully adequate with respect to the criteria presented in [2]. The paper defines the notion, proves its properties, and presents examples of its usefulness.