Weak and strong fairness in CCS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 176 LNCS, Issue , 1984, Pages 245-254

  Costa, Gerardo ^a   Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84933428788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0030305     Document Type: Conference Paper

References (15)

1. K. Apt and E. Olderog. ‘Proof rules and transformations dealing with fairness'. Theoretical Computer Science pp.65-100 (1983).
2. G. Costa and C. Stirling. ‘A fair calculus of communicating systems'. LNCS Vol.158 pp.94-105 (and extended version, Technical Report CSR-137-83, Dept. of Computer Science, Edinburgh). (1983)
3. G. Costa and C. Stirling. ‘Weak and strong fairness in CCS', to appear as a technical report.
4. Ph. Darondeau and L. Kott. ‘On the observational semantics of fair parallelism’ LNCS Vol.154 pp.147-159 (1983).
5. D. Gabbay, A. Pnueli, S. Shelah and J. Stavi. ‘On the temporal analysis of fairness'. Proc. 7th ACM POPL, Las Vegas (1980).
6. M. Hennessy. ‘Modelling finite delay operators', Technical Report CSR-153-83, Dept. of Computer Science, Edinburgh (1983).
7. M. Hennessy and C. Stirling. ‘The power of the future perfect in program logics', in this volume.
8. D. Lehmann, A. Pnueli and J. Stavi. ‘Impartiality, justice and fairness: the ethics of concurrent termination', LNCS Vol. 115, pp.264-77, (1981).
9. R. Milner. ‘A Calculus of Communicating Systems'. LNCS Vol.92, (1980).
10. R. Milner. ‘A finite delay operator in synchronous CCS'. Technical Report CSR-116-82, Dept. of Computer Science, Edinburgh University (1982).
11. S. Owicki and L. Lamport. ‘Proving liveness properties of concurrent programs'. ACM Transactions on Programming Languages and Systems pp.455-495 (1982).
12. D. Park. ‘On the semantics of fair parallelism'. LNCS Vol.85, pp.504-26 (1980).
13. D. Park. ‘A predicate transformer for weak fair iteration', in Proceedings 6th IBM Symposium on Mathematical Foundations of Computer Science, Hakone, Japan (1981).
14. G. Plotkin. ‘A powerdomain for countable nondeterminism', LNCS Vol.140 pp.418-28 (1982).
15. J. Queille and J. Sifakis. ‘Fairness and related properties in transition systems', Acta Informatica 19, pp. 195-220 (1983)