A framework for fair communicating processes

Electronic Notes in Theoretical Computer Science

Volumn 6, Issue , 1997, Pages 273-294

  Older, Susan ^a  

^a Syracuse University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; INTERACTIVE COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; SEMANTICS; SYNCHRONIZATION;

ABSTRACT REPRESENTATION; COMPOSITIONAL REASONING; DENOTATIONAL SEMANTICS; OPERATIONAL SEMANTICS;

COMMUNICATION SYSTEMS;

EID: 0013210839     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(05)80154-9     Document Type: Conference Paper

References (22)

1. Apt K.R., Prancez N., Katz S. Appraising fairness in languages for distributed programming. Distributed Computing. 2:(4):1988;226-241
2. Apt K.R., Olderog E.-R. Verification of Sequential and Concurrent Programs. 1991;Springer-Verlag
3. Brookes S. Fair communicating processes. A Classical Mind: Essays in Honour of C.A.R. Hoare, chapter 4. January 1994;Prentice-Hall
4. Brookes S. Full abstraction for a shared-variable parallel language. Information and Computation. 127:(2):June 15 1996;145-163
5. S. Brookes and S. Older. Full abstraction for strongly fair communicating processes. In S. Brookes, M. Main, A. Melton, and M. Mislove, editors, Proceedings of the 11th Annual Conference on Mathematical Foundations of Programming Semantics, volume 1 of Electronic Notes in Computer Science. Elsevier, June 1995.
6. Brookes S.D., Hoare C.A.R., Roscoe A.W. A theory of communicating sequential processes. JACM. 31:(3):July 1984;560-599
7. Darondeau P. About fair asynchrony. Theoretical Computer Science. 37:(3):1985;305-336
8. Prancez N. Fairness. Texts and Monographs in Computer Science. 1986;Springer-Verlag
9. Hennessy M. Acceptance trees. JACM. 32:(4):1985;896-928
10. Hennessy M. An algebraic theory of fair asynchronous communicating processes. Theoretical Computer Science. 49:1987;121-143
11. Hoare C.A.R. Communicating Sequential Processes. CACM. 21:(8):Aug. 1978;666-677
12. C. A. R. Hoare. A model for communicating sequential processes. Technical Report PRG-22, Oxford University Programming Research Group, Oxford, England, 1981.
13. Horita E., de Bakker J.W., Rutten J.J.M.M. Fully abstract models for nonuniform concurrent languages. Information and Computation. 115:(1):November 15 1994;125-178
14. Jonsson B. A fully abstract model for dataflow and asynchronous networks. Distributed Computing. 7:(4):1994;197-212
15. R. Kuiper and W. P. de Roever. Fairness assumptions for CSP in a temporal logic framework. In D. Bjørner, editor, Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts - II, pages 159 - 167. North-Holland, 1983.
16. Milner R. Processes: A mathematical model of computing agents. Rose H.E., Shepherdson J.C. Logic Colloquium '73. North-Holland/American Elsevier. volume 80:1975;157-173
17. Milner R. A Calculus of Communicating Systems. volume 92. 1980;Springer-Verlag
18. S. Older. A Denotational Framework for Fair Communicating Processes. PhD thesis, Carnegie Mellon University, 1996. Available as tech report CMU-CS-96 - 204.
19. Park D. On the semantics of fair parallelism. Bjørner D. Abstract Software Specifications, volume 86 of Lecture Notes in Computer Science. 1979;504-526 Springer-Verlag
20. G. D. Plotkin. An operational semantics for CSP. In D. Bj0rner, editor, Proceedings of the IFIP Working Conference on Formal Description of Programming Concepts - II, pages 199 - 225. North-Holland, 1983.
21. Pratt V. Modeling concurrency with partial orders. International Journal of Parallel Programming. 15:(1):February 1986;33-71
22. G. Winskel. Event structures. In W. Brauer, W. Reisig, and G. Rozenberg, editors, Advances in Petri Nets, 1986: Proceedings of an Advanced Course, volume 2 of LNCS, pages 325 - 392. Springer-Verlag, 1986.