- 1 Abramsky, S. A domain equation for bisimulation. J. Inf. Comput. 92 (1991), 161-218. Google ScholarDigital Library
- 2 Agha, G.A.Actors: A Model of Concurrent Computation in Distributed Systems. MIT Press, Cambridge, Mass., 1986 Google ScholarDigital Library
- 3 Astesiano, E. and Zucca, E. Parametric channels via label expressions in CCS, j, Theor. Comput,sci. 33 (1984), 45-64.Google Scholar
- 4 Baeten, J.C.M. and Weijland, W.P. Process Algebra. Cambridge University Press, Cambridge, Mass., 1990. Google ScholarDigital Library
- 5 Barendregt, H.P. The Lambda, Calcu lus. North Holland, Amsterdam, 1981.Google Scholar
- 6 Bohm, C. and Berarducci. A. Automatic sythesis of typed A-programs on term algebras. J. Theor. Comput- Sci. 39 (1985), 135-154.Google ScholarCross Ref
- 7 Brinksma, E. On the Design of Extended Lotos, A specification language for open distributed systems. Ph.D. dissertation, Univ. of Twente, 1988.Google Scholar
- 8 Brookes. S.D., Hoare, C.A.R., and Roscoe, A.W. Atheory of communicating sequential processes J. ACM 31 (1984), 560-599. Google ScholarDigital Library
- 9 Church, A. The Calculi of Lambda Conversion. Princeton University Press, Princeton, N.J., 1946 Google ScholarDigital Library
- 10 Engberg. U. and Nielsen, M. A, calculus of communicating systems with label passing. Rep. DAIMI pb-208 Computer Science Dept., Univ. of Arhus, Arhus, Denmark, 1986.Google Scholar
- 11 Girard, J.-Y. The system F of variable types, fifteen years later. J. Theor. Comput, Sci 45 (1986), 159-192. Google ScholarDigital Library
- 12 Goldber, A. and Robson, D. Smalltalk- 80: The Language and its Implementation Addison-Wesley, Reading Mass 1983 Google ScholarDigital Library
- 13 Gunter, C.A. and Scott, D.S. Semantic domains. In Handbook of Theretical Computer Science, Vol. A. Elsevier, New York, 1990, pp.633-674 Google ScholarDigital Library
- 14 Hennessy, M. Algebraic Theory of Processes . MIT Press, Cambridge, Mass., 1988. Google ScholarDigital Library
- 15 Hewitt, C.E., Bishop, P., Steiger, R.A. universal modular Actor formalsim for artificial intelligence. In proceedings of the INternational Joint Conference on Artificial Intelligence. 1973, on 235-245Google Scholar
- 16 Hoare, C.A.R. Communicating sequential i)r(messes. Commun. ACM 21 (1978), 666-677. Google ScholarDigital Library
- 17 Hoare, C.A.R. Communicating Sequential t roces.ws. Ptenti(:e-Hat{, Englewood Clit!~. N.J., 1985. Google ScholarDigital Library
- 18 Honda. K. and Tokoro, M. An object calculas for asynchronous communication. In proceedings of the European Conference on Object-Oriented Programming. Lecture Notes in Computer Science, vol. 512. Springer-Verlag, New York, 1991, pp. 133-147. Google ScholarDigital Library
- 19 Kennaway, J.R. and Sleep, M.R. Syntax and informal semantics of DyNe, a parallel language. In Lecture Notes in Computer Science, vol. 207. Springerverlag, newyork, 1985, pp 222-Google ScholarDigital Library
- 20 Milner, R~ Flow graphs and flow algebras. ACM 26, 4 (Oct. 1979), 794- 818, Google ScholarDigital Library
- 21 Milner, R. A Calculus of Communicating Systems. Lecture Notes in Computer Science, vol. 92. Springer- Verlag, New York 1980 Google ScholarDigital Library
- 22 Milner, R. Communication. and Concurrency. Prentice-Hall, Englewood Cliffs, N.J., 1989. Google ScholarDigital Library
- 23 Milner, R. The polyadic calculus; A tutorial. Res. Rep. LFCS. -91-180 Lab. for foundation of computer Science, Computer Science Dept., Edinburgh Univ., 1991.Google Scholar
- 24 Milner, R. Functions as processes. Res. Rep. No. 1154, INRIA, Sophia Antipolis, 1990,Google Scholar
- 25 Milner, R., Parrow, J. and Walker, D. A calculus of mobile processes. Rep. ECS-LFCS-89-85 and -86 Lab. for foundation of Computer Science, Computer, Science Dept., Edinburgh Univ. 1989.Google Scholar
- 26 Newell, A. and Simon, H.A. Computer seience as empriical enquiry; Symbols and search. Commun. ACM 19 (1976), 113-126 Google ScholarDigital Library
- 27 Nielson, F. The typed calculus with first-class processes. In Proceeeding of PARLE 89 Lecuture Notes in Computer Science, vol. 366. Springer- Verlag, New York, 1989. Google ScholarDigital Library
- 28 Nielsen, M., Plotkin, G.D. and Winskel, G. Petri nets, event structures and domains. J. Theor. Comput- Sci, 13 (1981).Google Scholar
- 29 Orava, F. and Parrow,j. An algebraic verification of a mobile network, Internal Rep., SICS, Sweden.Google Scholar
- 30 Park, D.M.R, Concurrency and automate on infinite sequences. In Lecture Notes in Computer Science, vol. 104. Springer-Verlag, New York, 1980Google ScholarDigital Library
- 31 Petri, C.A. Communikation mit Automaten. Schriften des Institutes fur Instrumentelle Mathematik, Bonn I962. In German.Google Scholar
- 32 Plotkin, G.D. A powerdomain construction. SIAM j. Comput. 5 (1976), 452-487.Google Scholar
- 33 Reisig, W. Petri Nets. EEATCS Monographs on Theoretical Computer Science, W. Brauer, G. Rozenberg, A. Solomaa, Eds. Springer-Verlag, New} York, 1983.Google Scholar
- 34 Reynolds, J.C. Towards a theory of type structure. In Lecture Notes in Computer Science, vol. 19. Springer- Verlag, New York, 1974, pp. 408- 425. Google ScholarDigital Library
- 35 Sangiorgi,. D. forthcoming Ph.D. thesis. Univ. of Edinburgh, 1992.Google Scholar
- 36 Tennent, R.D. Principles of Programming Languages. Prentice-Hall, Englewood Cliffs, N.J., 1981. Google ScholarDigital Library
- 37 Thomsen, B. Caluli for higherorder communicating systems. Ph.D. dissertation, Imperial College, London Univ. 1990.Google Scholar
- 38 Walker, D.j. r-calculus semantics of object-oriented programming languages. In Proceedings the Conference on Theoretical Aspect, of Computer Software (Japan). Lecture Notes in Computer Science, vol. 526. Springer- Verlag, New York, 1991, pp. 532 - 547 Google Scholar
Index Terms
Elements of interaction: Turing award lecture
Recommendations
On sequential composition, action prefixes and process prefix
AbstractWe illustrate the difference between sequential composition in process algebra axiomatisations like ACP and action prefixing in process calculi like CCS. We define both early and late input in a general framework extending ACP, and consider ...
Impossibility Results in the Equational Logic of Processes
This talk offers a survey of negative results on the existence of finite equational axiomatizations for bisimulation equivalence over fragments of algebraic process calculi.
Comments