On the semantics of atomized statements — the parallel-choice option —

1. J.A. Bergstra and J.W. Klop. Process algebra for synchronous communication. Information and Control, 60:109–137, 1984.

   Google Scholar 

2. J. Crammond. An execution model for committed-choice non-deterministic languages. In R.M. Kelly, editor, IEEE Symp. Logic Programming, pages 148–158. Computer Society Press, 1986.

   Google Scholar 

3. J.W. de Bakker. Mathematical Theory of Program Correctness. Prentice Hall, 1980.

   Google Scholar 

4. J.W. de Bakker. Comparative semantics for flow of control in logic programming without logic. Technical Report CS-R8840, CWI, 1988. To appear in Information and Computation.

   Google Scholar 

5. J.W. de Bakker and J.N. Kok. Comparative metric semantics for concurrent prolog. Theoretical Computer Science, 75:15–43, 1990.

   Google Scholar 

6. F.S. de Boer, J.N. Kok, C. Palamidess, and J.J.M.M. Rutten. The failure of failures: Towards a paradigm for asynchronous communication. Technical Report RUU-CS-90-40, Utrecht University, Utrecht, 1990.

   Google Scholar 

7. F.S. de Boer and C. Palamidessi. On the asynchronous nature of communication in concurrent logic languages: A fully abstract model based on sequences. In Proceedings Concur, pages 99–114. Lecture Notes in Computer Science 458, Springer Verlag, 1990.

   Google Scholar 

8. E.P. de Vink. Designing stream based semantics for uniform concurrency and logic programming. PhD thesis, Free University, 1990.

   Google Scholar 

9. R. Gorrieri, S. Marchetti, and U. Montanari. A²CCS: Atomic actions for CCS. Theoretical Computer Science, 72:203–223, 1990.

   Google Scholar 

10. C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1985.

    Google Scholar 

11. He Jifeng, M.B. Josephs, and C.A.R. Hoare. A theory of synchrony and asynchrony. In Proc. of IFIP Working Conference on Programming Concepts and Methods, pages 459–478, 1990.

    Google Scholar 

12. K.L. Clark and S. Gregory. Parallel programming in logic. ACM Trans. Programming Language Systems, 8(1):1–49, 1986.

    Google Scholar 

13. P.M.W. Knijnenburg and J.N. Kok. Semantic models for parallel choice in combination with atomicity. Technical report, Utrecht University, 1991.

    Google Scholar 

14. P.M.W. Knijnenburg. Algebraic domains, chain completion and the powerdomain construction. Technical report, Utrecht University, 1991.

    Google Scholar 

15. L. Lamport. The ‘Hoare logic’ of concurrent programs. Acta Informatica, 14:21–37, 1980.

    Google Scholar 

16. G.D. Plotkin. A powerdomain construction. SIAM J. on Computing, 5:452–487, 1976.

    Google Scholar 

17. G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Aarhus University, 1981.

    Google Scholar 

18. E.Y. Shapiro. Concurrent Prolog: Collected Papers. MIT Press, 1988.

    Google Scholar 

19. K. Ueda. Guarded Horn Clauses, a parallel logic programming language with the concept of a guard. In M. Nivat and K. Fuchi, editors, Programming of Future Generation Computers, pages 441–456. North Holland, Amsterdam, 1988.

    Google Scholar 

20. R. van Glabbeek and U. Goltz. Refinement of actions in causality based models. In W.-P. de Roever J.W. de Bakker and G. Rozenberg, editors, Stepwise Refinement of Distributed Systems, volume 430 of Lecture Notes in Computer Science, pages 267–300. Springer Verlag, 1989.

    Google Scholar 

Download references