Event fairness and non-interleaving concurrency
Open Access
- 1 March 1989
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in Formal Aspects of Computing
- Vol. 1 (1) , 213-228
Abstract
Event fairness suitable for non-interleaving concurrency is proposed. Fairness is viewed with respect to concurrency, rather than non-determinism, in the sense that no concurrent component of the system should be delayed indefinitely. Shields' asynchronous transition systems and Mazurkiewicz's traces have been used; the model gives rise to a partial order. A class of generalised notions of (weak, strong and unconditional) event fairness relative to progress requirements is derived. The weakest fairness notion in this class is shown to coincide with maximality with respect to the partial order over traces.Keywords
This publication has 15 references indexed in Scilit:
- Permutation of transitions: An event structure semantics for CCS and SCCS1989
- Weak and strong fairness in CCSInformation and Computation, 1987
- Petri nets: Basic notions, structure, behaviour1986
- Deterministic asynchronous automataLecture Notes in Computer Science, 1985
- Fairness and conspiracies: Information processing letters Vol. 18, No. 4 (14 May 1984) pp. 215-220Information Processing Letters, 1984
- Fairness and conspiraciesInformation Processing Letters, 1984
- A powerdomain for countable non-determinism1982
- Impartiality, justice and fairness: The ethics of concurrent termination1981
- Adherences of languagesJournal of Computer and System Sciences, 1980
- On the semantics of fair parallelism1980