Rewriting as a unified model of concurrency

ABSTRACT

The lecture given at the workshop was based on recent work published elsewhere [9, 10, 8, 7]. This abstract gives a brief description of the main results and ideas presented in that work, but does not provide any technical details; such details can be found in the papers mentioned above.

REFERENCES

• 1: [1] G. Agha. Actors. MIT Press, 1986.
• 2: [2] G. Agha and C. Hewitt. Concurrent programming using actors. In A. Yonezawa and M. Tokoro, editors, Object-Oriented Concurrent Programming. MIT Press, 1988.
• 3: Gerard Berry , Gerard Boudol, The chemical abstract machine, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.81-94, December 1989, San Francisco, California, United States [doi>10.1145/96709.96717]
• 4: K. Mani Chandy, Parallel program design: a foundation, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1988
• 5: J. Goguen , C. Kirchner , J. Meseguer , H. Kirchner , T. Winkler , A. Megrelis, An introduction to OBJ 3, 1st international workshop on Conditional Term Rewriting Systems, p.258-263, August 1988, Orsay, France
• 6: [6] Saunders MacLane. Categories for the working mathematician. Springer, 1971.
• 7: José Meseguer, Conditional Rewriting Logic: Deduction, Models and Concurrency, Proceedings of the 2nd International CTRS Workshop on Conditional and Typed Rewriting Systems, p.64-91, June 11-14, 1990
• 8: José Meseguer, A logical theory of concurrent objects, Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications, p.101-115, September 1990, Ottawa, Canada
• 9: [9] José Meseguer. Rewriting as a unified model of concurrency. Technical Report SRI-CSL-90-02, SRI International, Computer Science Laboratory, February 1990. Submitted for publication; revised June 1990.
• 10: [10] José Meseguer. Rewriting as a unified model of concurrency. In Proceedings of the Concur'90 Conference, Amsterdam, August 1990, pages 384-400. Springer LNCS Vol. 458, 1990.
• 11: [11] José Meseguer and Ugo Montanari. Petri nets are monoids: A new algebraic foundation for net theory. In Proc. LICS'88, pages 155-164. IEEE, 1988.
• 12: [12] José Meseguer and Ugo Montanari. Petri nets are monoids. Info and Co, 88:105-155, 1990. Appeared as SRI Tech Report SRI-CSL-88-3, January 1988.
• 13: R. Milner, Communication and Concurrency, Prentice-Hall, Inc., Upper Saddle River, NJ, 1989

INDEX TERMS

Primary Classification:
  F. Theory of Computation
  F.1 COMPUTATION BY ABSTRACT DEVICES
      F.1.2 Modes of Computation
          Subjects: Parallelism and concurrency

Additional Classification:
  D. Software
  D.1 PROGRAMMING TECHNIQUES

  F. Theory of Computation
  F.4 MATHEMATICAL LOGIC AND FORMAL LANGUAGES
      F.4.2 Grammars and Other Rewriting Systems
          Subjects: Parallel rewriting systems (e.g., developmental systems, L-systems)

General Terms:
Design, Languages, Theory