Script: a communication abstraction mechanism and its verification
Science of Computer Programming
Fairness
Introduction to the ISO specification language LOTOS
Computer Networks and ISDN Systems - Special Issue: Protocol Specification and Testing
Distributed cooperation with action systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Object-oriented specification of reactive systems
ICSE '90 Proceedings of the 12th international conference on Software engineering
Global and local views of state fairness
Theoretical Computer Science
A calculus of mobile processes, I
Information and Computation
Interacting processes: a multiparty approach to coordinated distributed programming
Interacting processes: a multiparty approach to coordinated distributed programming
A comprehensive study of the complexity of multiparty interaction
Journal of the ACM (JACM)
On strong-feasibilities of equivalence-completions
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Fairness and control in multi-agent systems
Theoretical Computer Science
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Effective Implementation for the Generalized Input-Output Construct of CSP
ACM Transactions on Programming Languages and Systems (TOPLAS)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Communicating sequential processes
Communications of the ACM
Communication and Concurrency
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Characterizing Fairness Implementability for Multiparty Interaction
ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
Defining Fairness in Reactive and Concurrent Systems
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We propose a localizability criterion that allows local computations to be composed into a valid global one. We show that, in the presence of equivalence-robustness, most fairness notions proposed in the literature satisfy the localizability criterion. Moreover, we also present a general and effcient distributed algorithm to implement equivalence-robust fairness notions satisfying the localizability criterion. Our results therefore offer an appealing solution to the implementation problem for existing fairness notions for distributed programming languages and algebraic models of concurrency.