Strong fairness and full abstraction for communicating processes

Information and Computation

Volumn 163, Issue 2, 2000, Pages 471-509

  Older, Susan ^a  

^a Syracuse University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATION THEORY; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS;

COMMUNICATING PROCESSES;

SEMANTICS;

EID: 0034672931     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2000.2886     Document Type: Article

References (25)

1. Apt, K. R., Francez, N., and Katz, S. (1988), Appraising fairness in languages for distributed programming, Distrib. Comput. 2, 226-241.
2. Apt, K. R., and Plotkin, G. D. (1986), Countable nondeterminism and random assignment, J. Assoc. Comput. Mach. 33, 724-767.
3. Brookes, S. (1994), Fair communicating processes, in "A Classical Mind: Essays in Honour of C.A.R. Hoare," Chap. 4, Prentice-Hall, Englewood Cliffs, NJ.
4. Brookes, S. (1996a), The essence of Parallel Algol, in "Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science," IEEE Computer Society Press, New York.
5. Brookes, S. (1996b), Full abstraction for a shared-variable parallel language, Inform. and Comput. 127, 145-163.
6. Brookes, S., and Older, S. (1995), Full abstraction for strongly fair communicating processes, in "Proceedings of the 11th Annual Conference on Mathematical Foundations of Programming Semantics" (S. Brookes, M. Main, A. Melton, and M. Mislove, Eds.), Electronic Notes in Computer Science, Vol. 1, Elsevier, Amsterdam.
7. Brookes, S. D., Hoare, C. A. R., and Roscoe, A. W. (1984), A theory of communicating sequential processes, J. Assoc. Comput. Mach. 31, 560-599.
8. Costa, G., and Stirling, C. (1987), Weak and strong fairness in CCS, Inform. and Comput. 73, 207-244.
9. Darondeau, P. (1985), About fair asynchrony, Theoret. Comput. Sci. 37, 305-336.
10. Francez, N. (1986), "Fairness," Texts and Monographs in Computer Science, Springer-Verlag, Berlin.
11. Hennessy, M. (1985), Acceptance trees, J. Assoc. Comput. Mach. 32, 896-928.
12. Hennessy, M. (1987), An algebraic theory of fair asynchronous communicating processes, Theoret. Comput. Sci. 49, 121-143.
13. Hoare, C. A. R. (1978), Communicating sequential processes, Commun. Assoc. Comput. Mach. 21, 666-677.
14. Hoare, C. A. R. (1981), A model for communicating sequential processes, Technical Report PRG-22, Oxford University Programming Research Group, Oxford, England.
15. Horita, E., de Bakker, J. W., and Rutten, J. J. M. M. (1994), Fully abstract models for nonuniform concurrent languages, Inform. and Comput. 115, 125-178.
16. INMOS Limited, (1984), "The Occam Programming Manual," Prentice-Hall, Englewood Cliffs, NJ.
17. Jonsson, B. (1994), A fully abstract model for dataflow and asynchronous networks, Distrib. Comput. 7, 197-212.
18. Kuiper, R., and de Roever, W. P. (1983), Fairness assumptions for CSP in a temporal logic framework, in "Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts - II" (D. Bjørner, Ed.), pp. 159-167, North-Holland, Amsterdam.
19. Lamport, L. (1983), What good is temporal logic?, in "Information Processing 83: Proceedings of the IFIP 9th World Congress" (R. E. A. Mason, Ed.), pp. 657-668, North-Holland, Amsterdam.
20. Milner, R. (1975), Processes: A mathematical model of computing agents, in "Logic Colloquium'73" (H. E. Rose and J. C. Shepherdson, Eds.), Vol. 80, pp. 157-173, North-Holland/American Elsevier, New York.
21. Milner, R. (1980), "A Calculus of Communicating Systems," Vol. 92, Springer-Verlag, Berlin.
22. Older, S. (1996), A Denotational Framework for Fair Communicating Processes, Ph.D. thesis, Carnegie Mellon University. Available as Tech Report CMU-CS-96-204.
23. Older, S. (1997), A framework for fair communicating processes, in "Proceedings of the 13th Annual Conference on Mathematical Foundations of Programming Semantics," Electronic Notes in Computer Science, Vol. 6, Elsevier, Amsterdam.
24. Park, D. (1979), On the semantics of fair parallelism, in "Abstract Software Specifications" (D. Bjørner, Ed.), Lecture Notes in Computer Science, Vol. 86, pp. 504-526, Springer-Verlag, Berlin.
25. Plotkin, G. D. (1983), An operational semantics for CSP, in "Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts - II," pp. 199-225, North-Holland, Amsterdam.