Advertisement

Designing equivalent semantic models for process creation

  • Pierre America
  • Jaco de Bakker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 280)

Abstract

Operational and denotational semantic models are designed for languages with process creation, and the relationships between the two semantics are investigated. The presentation is organized in four sections dealing with a uniform and static, a uniform and dynamic, a nonuniform and static, and a nonuniform and dynamic language, respectively. Here uniform/nonuniform refers to a language with uninterpreted/interpreted elementary actions, and static/dynamic to the distinction between languages with a fixed/growing number of parallel processes. The contrast between uniform and nonuniform is reflected in the use of linear time versus branching time models., the latter employing a version of Plotkin's resumptions. The operational semantics make use of Hennessy and Plotkin's transition systems. All models are built on metric structures, and involve continuations in an essential way. The languages studied are abstractions of the parallel object-oriented language POOL for which we have designed separate operational and denotational semantics in earlier work. The paper provides a full analysis of the relationship between the two semantics for these abstractions. Technically, a key role is played by a new operator which is able to decide dynamically whether it should act as sequential or parallel composition.

Keywords

Corn Opium Prefix Cond SeCo 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Ad]
    The Programming Language Ada Reference Manual. American National Standards Institute, ANSI/MIL-STD-1815A-1983. (Also published as: Lecture Notes in Computer Science, Vol. 155, Springer-Verlag, 1983.)Google Scholar
  2. [Ag]
    G. Agha: Semantic considerations in the Actor paradigm of concurrent computations. In: S.D. Brookes, A.W. Roscoe, G. Winskel (eds.): Seminar on Concurrency, Carnegie-Mellon University, Pittsburgh, Pennsylvania, July 9–11, 1984, Springer-Verlag, Lecture Notes in Computer Science, Vol. 197, pp. 151–179.Google Scholar
  3. [Am1]
    P. America: Definition of the programming language POOL-T. ESPRIT project 415, Doc. No. 91, Philips Research Laboratories, Eindhoven, the Netherlands, September 1985.Google Scholar
  4. [Am2]
    P. America: Rationale for the design of POOL. ESPRIT project 415, Doc. No. 53, Philips Research Laboratories, Eindhoven, the Netherlands, January 1986.Google Scholar
  5. [Am3]
    P. America: Object-oriented programming: a theoretician's introduction. Bulletin of the European Association for Theoretical Computer Science, No. 29, June 1986, pp. 69–84.Google Scholar
  6. [ABKR1]
    P. America, J.W. de Bakker, J.N. Kok, J.J.M.M. Rutten: Operational semantics of a parallel object-oriented language. Conference Record of the 13th Symposium on Principles of Programming Languages, St. Petersburg, Florida, January 13–15, 1986, pp. 194–208.Google Scholar
  7. [ABKR2]
    P. America, J.W. de Bakker, J.N. Kok, J.J.M.M. Rutten: A denotational semantics of a parallel object-oriented language. Report CS-R8626, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, August 1986.Google Scholar
  8. [AR]
    P. America, J.J.M.M. Rutten: Solving reflexive domain equations in a category of complete metric spaces. Report CS-R8709, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, February 1987. (To appear in Proceedings of the Third Workshop on Mathematical Foundations of Programming Language Semantics.)Google Scholar
  9. [Ap1]
    K.R. Apt: Recursive assertions and parallel programs. Acta Informatica, Vol. 15, 1981, pp. 219–232.CrossRefGoogle Scholar
  10. [Ap2]
    K.R. Apt: Formal justification of a proof system for Communicating Sequential Processes. Journal of the ACM, Vol. 30, No. 1, January 1983, pp. 197–216.CrossRefGoogle Scholar
  11. [BBKM]
    J.W. de Bakker, J.A. Bergstra, J.W. Klop, J.-J.Ch. Meyer: Linear time and branching time semantics for recursion with merge. Theoretical Computer Science, Vol. 34, 1984, pp. 135–156.CrossRefGoogle Scholar
  12. [BKMOZ]
    J.W. de Bakker, J.N. Kok, J.-J.Ch. Meyer, E.-R. Olderog, J.I. Zucker: Contrasting themes in the semantics of imperative concurrency. In: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (eds.): Current Trends in Concurrency — Overviews and Tutorials. Springer-Verlag, Lecture Notes in Computer Science, Vol. 224, 1986, pp. 51–121.Google Scholar
  13. [BM]
    J.W. de Bakker, J.-J.Ch. Meyer: Order and metric in the stream semantics of elemental concurrency. Report CS-R8638, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, December 1986. (To appear in Acta Informatica.)Google Scholar
  14. [BMO]
    J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog: Infinite streams and finite observations in the semantics of uniform concurrency. Report CS-R8512, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, September 1985. (To appear in Theoretical Computer Science.)Google Scholar
  15. [BMOZ1]
    J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, J.I. Zucker: Transition systems, infinitary languages and the semantics of uniform concurrency. Proceedings of the 17th ACM Symposium on the Theory of Computing, Providence, R.I., 1985, pp. 252–262.Google Scholar
  16. [BMOZ2]
    J.W. de Bakker, J.-J.Ch. Meyer, E.-R. Olderog, J.I. Zucker: Transition systems, metric spaces and ready sets in the semantics of uniform concurrency. Report CS-R8601, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, January 1986. (Full version of [BMOZ1], to appear in Journal of Computer and Systems Sciences.)Google Scholar
  17. [BZ]
    J.W. de Bakker, J.I. Zucker: Processes and the denotational semantics of concurrency. Information and Control, Vol. 54, 1982, pp. 70–120.CrossRefGoogle Scholar
  18. [BK]
    J.A. Bergstra, J.W. Klop: Process algebra for synchronous communication. Information and Control, Vol. 60, 1984, pp. 109–137.CrossRefGoogle Scholar
  19. [Bo]
    F.S. de Boer: A proof rule for process creation. Report CS-R8710, Centre for Mathematics and Computer Science, Amsterdam, the Netherlands, February 1987. (Also to appear in: M. Wirsing (ed.): Formal description of programming concepts III, Proceedings of the third IFIP WG 2.2 working conference, Gl. Avernæs, Ebberup, Denmark, August 25–28, 1986, North-Holland.)Google Scholar
  20. [Br1]
    M. Broy: Fixed point theory for communication and concurrency. In: D. Bjørner (ed.): Formal description of programming concepts II, North-Holland, 1983, pp. 125–146.Google Scholar
  21. [Br2]
    M. Broy: Applicative real-time programming. In: R.E.A. Mason (ed.): Information Processing '83 — Proceedings of the IFIP conference, North-Holland, 1983, pp. 259–264.Google Scholar
  22. [BrB]
    A. de Bruin, A.P.W. Böhm: The denotational semantics of dynamic networks of processes. ACM Transactions on Programming Languages and Systems, Vol. 7, No. 4, October 1985, pp. 656–679.CrossRefGoogle Scholar
  23. [Cl]
    W.D. Clinger: Foundations of actor semantics. Technical report 633, Massachusetts Institute of Technology, Artificial Intelligence Laboratory, May 1981.Google Scholar
  24. [DMN]
    O.-J. Dahl, B. Myhrhaug, K. Nygaard: SIMULA 67, Common Base Language. Norwegian Computing Center, Forskningsvn. lb., Oslo, Norway, 1967.Google Scholar
  25. [Du]
    J. Dugundji: Topology. Allen and Bacon, Rockleigh, N.J., 1966.Google Scholar
  26. [En]
    R. Engelking: General topology. Polish Scientific Publishers, 1977.Google Scholar
  27. [Gi]
    G. Gierz, K.H. Hofmann, K. Keimel, J.D. Lawson, M. Mislove, D.S. Scott: A Compendium of Continuous Lattices. Springer-Verlag, 1980.Google Scholar
  28. [Ha]
    H. Hahn: Reelle Funktionen. Chelsea, New York, 1948.Google Scholar
  29. [HP]
    M. Hennessy, G.D. Plotkin: Full abstraction for a simple parallel programming language. In: J. Bečvář (ed.): Proceedings of the 8th Symposium on Mathematical Foundations of Computer Science. Springer-Verlag, Lecture Notes in Computer Science Vol. 74, 1979, pp. 108–120.Google Scholar
  30. [He]
    C. Hewitt: Viewing control structures as patterns of passing messages. Artificial Intelligence, Vol. 8, 1977, pp. 323–364.CrossRefGoogle Scholar
  31. [Ho1]
    C.A.R. Hoare: Communicating Sequential Processes. Communications of the ACM, Vol. 21, No. 8, August 1978, pp. 666–677.CrossRefGoogle Scholar
  32. [Ho2]
    C.A.R. Hoare: Communicating Sequential Processes. Prentice-Hall International, Englewood Cliffs, New Jersey, 1985.Google Scholar
  33. [M]
    J.-J.Ch. Meyer: Merging regular processes by means of fixed point theory. Theoretical Computer Science, Vol. 45, 1986, pp. 193–260.CrossRefGoogle Scholar
  34. [MdV]
    J.-J.Ch. Meyer, E.P. de Vink: Applications of compactness in the Smyth powerdomain of streams. Report IR-110, Free University of Amsterdam, Department of Mathematics and Computer Science, Amsterdam, the Netherlands, August 1986. (To appear in TAPSOFT 1987.)Google Scholar
  35. [Ni]
    M. Nivat: Infinite words, infinite trees, infinite computations. In: Foundations of Computer Science III.2, Mathematical Centre Tracts, Vol. 109, 1979, pp. 3–52.Google Scholar
  36. [Niw]
    D. Niwinski: Fixed point semantics for algebraic (tree) grammars. In: M. Nielsen, E.M. Schmidt (eds.): Proceedings of the 9th International Colloquium on Automata, Languages and Programming, 1982, Springer-Verlag, Lecture Notes in Computer Science Vol. 140, pp. 384–396.Google Scholar
  37. [Pl1]
    G.D. Plotkin: A powerdomain construction. SIAM Journal of Computing, Vol. 5, No. 3, September 1976, pp. 452–487.CrossRefGoogle Scholar
  38. [Pl2]
    G.D. Plotkin: A structural approach to operational semantics. Report DAIMI FN-19, Aarhus University, Computer Science Department, September 1981.Google Scholar
  39. [Pl3]
    G.D. Plotkin: An operational semantics for CSP. In: D. Bjørner (ed.): Formal description of programming concepts II. North-Holland, 1983, pp. 199–223.Google Scholar
  40. [Pn]
    A. Pnueli: Linear and branching structures in the semantics and logics of reactive systems. In: W. Brauer (ed.): Proceedings of the 12th International Colloquium on Automata, Languages and Programming (ICALP), Nafplion, Greece, July 15–19, 1985, Springer-Verlag, Lecture Notes in Computer Science, Vol. 194, pp. 15–32.Google Scholar
  41. [Ro]
    W.C. Rounds: On the relationship between Scott domains, synchronization trees and metric spaces. Report CRL-TR-25-83, University of Michigan, 1983.Google Scholar
  42. [Sa]
    V.A. Saraswat: The concurrent logic programming language CP: definition and operational semantics. In: Conference Record of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, München, West Germany, January 21–23, 1987, pp. 49–62.Google Scholar
  43. [SS]
    S.A. Smolka, R.E. Strom: A CCS semantics for NIL. To appear in: M. Wirsing: Formal description of programming concepts III. Proceedings of the third IFIP WG 2.2 working conference, Gl. Avernæs, Ebberup, Denmark, August 25–28, 1986, North-Holland.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Pierre America
    • 1
  • Jaco de Bakker
    • 2
  1. 1.Philips Research LaboratoriesEindhovenThe Netherlands
  2. 2.Centre for Mathematics and Computer ScienceAmsterdamThe Netherlands

Personalised recommendations