Three semantics of the output operation for generative communication

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

Volumn 1282, Issue , 1997, Pages 205-219

  Busi, Nadia ^a   Gorrieri, Roberto ^b   Zavattaro, Gianluigi ^b  

^a UNIVERSITY OF SIENA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS;

BEHAVIOURAL SEMANTICS; BISIMULATIONS; COARSEST CONGRUENCE; GENERATIVE COMMUNICATION; OPERATIONAL SEMANTICS;

SEMANTICS;

EID: 84957105440     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63383-9_82     Document Type: Conference Paper

References (20)

1. R. Amadio, I. Castellani, and D. Sangiorgi. On Bisimulations for the Asynchronous π-Calculus. In Proc. CONCUR'96, volume 1119 of LNCS, pages 147–162, Springer Verlag, 1996.
2. G. Boudol. Asynchrony and the π-calculus. Technical Report 1702, INRIA, Sophia-Antipolis, 1992.
3. N. Busi and R. Gorrieri. A Petri Net Semantics for π-calculus. In Proc. CONCUR'95, volume 962 of LNCS, pages 145–159, Springer Verlag, 1995.
4. N. Busi, R. Gorrieri, and G. Zavattaro. A Truly Concurrent view of Linda Interprocess Communication. Technical Report UBLCS-97-02, Department of Computer Science, University of Bologna, February 1997.
5. N. Busi, R. Gorrieri, and G. Zavattaro. On the Turing Equivalence of Linda Coordination Primitives. Technical Report UBLCS-97-05, Department of Computer Science, University of Bologna, May 1997.
6. N. Busi, R. Gorrieri, and G. Zavattaro, A Process Algebraic View of Linda Coordination Primitives. To appear in Theoretical Computer Science. Available as Technical Report UBLCS-97-06, Department of Computer Science, University of Bologna, May 1997.
7. N. Busi and G.M. Pinna. A Causal Semantics for Contextual P/T nets. In Proc. ICTCS'95, 311–325, World Scientific, 1995.
8. P. Ciancarini, R. Gorrieri, and G. Zavattaro. Towards a Calculus for Generative Communication. In Proc. 1st IFIP Conf. on FMOODS'96, pages 283–297. Chapman & Hall, 1996.
9. D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, 1985.
10. D. Gelernter and N. Carriero. Coordination Languages and their Significance. Communications of the ACM, 35(2):97–107, 1992.
11. J.F. Groote. Transition system specifications with negative premises. Theoretical Computer Science, 118:263–299, 1993.
12. M. Hansen, J. Kleist, and H. Hüttel. Bisimulations for Asynchronous Mobile Processes. In Proc. Tbilisi Symposium on Language, Logic, and Computation, 1995.
13. K. Honda and M. Tokoro. An Object Calculus for Asynchronous Communication. In Proc. ECOOP '91, volume 512 of LNCS, pages 133–147. Springer Verlag, 1991.
14. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
15. R. Milner and D. Sangiorgi. Barbed Bisimulation. In Proc. ICALP'92, volume 623 of LNCS, pages 685–695, Springer Verlag, 1992.
16. M. L. Minsky. Computation: finite and infinite machines. Prentice-Hall, En-glewood Cliffs, 1967.
17. U. Montanari and F. Rossi. Contextual Nets. Acta Informatica, 32(6):545–596, 1995.
18. J. E. Narem. An Informal Operational Semantics of C-Linda V2.3.5. Technical Report YALEU/DCS/TR-839, Department of Computer Science, Yale University, December 1990.
19. Scientific Computing Associates. Linda: User's guide and reference manual. Scientific Computing Associates, 1995.
20. J. C. Shepherdson and J. E. Sturgis. Computability of recursive functions. Journal of the ACM, 10:217–255, 1963.