Traces, pomsets, fairness and full abstraction for communicating processes

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

Volumn 2421 LNCS, Issue , 2002, Pages 466-482

  Brookes, Stephen ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATING PROCESS; COMMUNICATION BEHAVIOR; DENOTATIONAL TRACE SEMANTICS; FULL ABSTRACTION; PARTIAL ORDER; PARTIAL ORDER SEMANTICS; SHARED-MEMORY PARALLELS; SYNCHRONOUS COMMUNICATIONS; INTERLEAVINGS;

SEMANTICS;

EID: 34047169541     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_31     Document Type: Conference Paper

References (35)

1. K. R. Apt, N. Francez, and S. Katz, Appraising fairness in languages for distributed programming, Distributed Computing, 2(4):226-241, 1988.
2. J. A. Bergstra and J.-W. Klop, Process Algebra for Synchronous Communication, Information and Computation, 60(1/3):109-137, 1984.
3. J. A. Bergstra, J.-W. Klop, and J. Tucker, Process algebra with asynchronous communication mechanisms, Seminar on Concurrency, Springer LNCS 197, pp. 76-95, 1985.
4. F. de Boer, J. Kok, C. Palamidessi, and J. Rutten, The failure of failures in a paradigm for asynchronous concurrency, CONCUR'91, Springer LNCS 527, pp. 111-126, 1991.
5. S. Brookes, Full abstraction for a shared-variable parallel language, Information and Computation, 127(2):145-163, June 1996.
6. th LICS, pp. 164-173, July 1996.
7. S. Brookes, Idealized CSP: Combining Procedures with Communicating Processes, Proc. MFPS XIII, ENTCS 6, Elsevier Science, 1997.
8. S. Brookes, On the Kahn Principle and Fair Networks, MFPS XIV, Queen Mary Westfield College, University of London, May 1998.
9. S. Brookes, Deconstructing CCS and CSP: Asynchronous Communication, Fairness and Full Abstraction, MFPS XVI, 2000.
10. S. Brookes and S. Older, Full abstraction for strongly fair communicating processes, MFPS XI, ENTCS 1, Elsevier Science, 1995.
11. S. Brookes, C. A. R. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes, JACM 31(3):560-599, July 1984.
12. S. Brookes, and A. W. Roscoe, An improved failures model for CSP, Seminar on concurrency, Springer-Verlag, LNCS 197, 1984.
13. G. Costa and C. Stirling, A fair calculus of communicating systems, ACTA Informatica 21:417-441, 1984.
14. G. Costa and C. Stirling, Weak and strong fairness in CCS, Technical Report CSR-16-85, University of Edinburgh, January 1985.
15. N. Francez, Fairness, Springer-Verlag, 1986.
16. R. van Glabbeek, The Linear Time-Branching Time Spectrum, Handbook of Process Algebra, Elsevier, 2001.
17. M. Hennessy, An algebraic theory of fair asynchronous communicating processes, Theoretical Computer Science, 49:121-143, 1987.
18. M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, JACM 32(1):137-161, 1985.
19. C. A. R. Hoare, Communicating Sequential Processes, CACM 21(8):666-677, 1978.
20. C. A. R. Hoare, A Model for Communicating Sequential Processes, Technical Monograph PRG-22, Oxford University, June 1981.
21. C. A. R. Hoare, Communicating Sequential Processes, Prentice-Hall, 1985.
22. R. Milner, A Calculus of Communicating Systems, Springer LNCS 92, 1980.
23. R. Milner, Communication and Concurrency, Prentice-Hall, London, 1989.
24. S. Older, A Denotational Framework for Fair Communicating Processes, Ph.D. thesis, Carnegie Mellon University, December 1996.
25. S. Older, A Framework for Fair Communicating Processes, Proc. MFPS XIII, ENTCS 6, Elsevier Science, 1997.
26. S. Owicki and L. Lamport, Proving liveness properties of concurrent programs, ACM TOPLAS, 4(3): 455-495, July 1982.
27. D. Park, On the semantics of fair parallelism. Abstract Software Specifications, Springer-Verlag LNCS vol. 86, 504-526, 1979.
28. C. A. Petri, Concepts of Net Theory, Symposium on Mathematical Foundations of Computer Science, September 1973. 480
29. J. Parrow, Fairness Properties in Process Algebras, Ph. D. thesis, University of Uppsala, 1985.
30. I. Phillips, Refusal testing, Theoretical Computer Science, 50(2):241-284, 1987.
31. th ACM POPL Symp., 1982.
32. V. Pratt, Modeling concurrency with partial orders, International Journal on Parallel Processing, 15(1): 33-71, 1986.
33. A. W. Roscoe, The Theory and Practice of Concurrency, Prentice-Hall, 1998.
34. th ACM POPL Symposium, 1991.
35. G. Winskel, Events in Computation, Ph. D. thesis, Edinburgh University, 1980.