Net-based description of parallel object-based systems, or POTs and POPs

  • Joost Engelfriet
  • George Leih
  • Grzegorz Rozenberg
Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 489)


Two formalisms, called POT and POP, are introduced for modelling parallel object-based systems. The first formalism is on the level of transition systems and the second on the program level. Both formalisms are based on Petri nets. A POT is obtained from a Petri net by the addition of components that handle specific object-based features such as object identity, object creation (and destruction), private memory of objects, and references to objects. Parallelism and synchronization are handled by the Petri net. A POP is a program that may be viewed as an abbreviation of a (usually infinite) POT, comparable to a high-level Petri net.


Parallel object-based transition system Petri net communication handshaking actor system observation operational semantics 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Agh]
    G. Agha; Actors: a model of concurrent computation in distributed systems, The MIT Press, Cambridge, Mass., 1986Google Scholar
  2. [Ame1]
    P. America; Object-oriented programming: a theoretician's introduction, Bulletin of the EATCS 29 (1986), 69–84Google Scholar
  3. [Ame2]
    P. America; Issues in the design of a parallel object-oriented language, Formal Aspects of Computing 1 (1989), 366–411Google Scholar
  4. [AmeBak]
    P. America, J.W. de Bakker; Designing equivalent semantic models for process creation, Theor. Comput. Science 60 (1988), 109–176Google Scholar
  5. [AmeBakKokRut]
    P.America, Bakker, J.N.Kok, J.J.M.M.Rutten; Operational semantics of a parallel object-oriented language, in Conf. Record of the 13th Symp. on Principles of Programming Languages, Florida, 1986, 194–208Google Scholar
  6. [AmeRut]
    P.America, J.Rutten; A parallel object-oriented language: design and semantic foundations, Ph.D. Theses, 1989Google Scholar
  7. [BalSteTan]
    H.E. Bal, J.G. Steiner, A.S. Tanenbaum; Programming languages for distributed computing systems, ACM Computing Surveys 21 (1989), 261–322Google Scholar
  8. [BanCouLem]
    J.-P.Banatre, A.Coutant, D.Le Metayer; Parallel machines for multiset transformation and their programming style, Report No.759, INRIA, Rennes, 1987Google Scholar
  9. [BanLem]
    J.-P.Banatre, D.Le Metayer; Programming by multiset transformation, Report No.1205, INRIA, Rennes, 1990Google Scholar
  10. [BatDecMau]
    E. Battiston, F. De Cindio, G. Mauri; OBJSA nets: a class of high-level nets having objects as domain, in "Advances in Petri Nets 1988" (G. Rozenberg, ed.), Lecture Notes in Computer Science 340, Springer-verlag, Berlin, 1988, 20–43Google Scholar
  11. [BerBou]
    G.Berry, G.Boudol; The chemical abstract machine, Report No. 1133, INRIA, Sophia Antipolis, 1989Google Scholar
  12. [Bes]
    E.Best; COSY: its relation to nets and CSP, in [BraReiRoz], Part II, 416–440Google Scholar
  13. [BesFer]
    E. Best, C. Fernández C.; "Nonsequential processes", EATCS Monographs on Theoretical Computer Science Vol. 13, Springer-Verlag, Berlin, 1988Google Scholar
  14. [BraReiRoz]
    W. Brauer, W. Reisig, G. Rozenberg (eds.), Petri nets: central models and their properties, and Petri nets: applications and relationships to other models of concurrency, Lecture Notes in Computer Science 254 and 255, Springer-Verlag, Berlin, 1987Google Scholar
  15. [CarGel]
    N. Carriero, D. Gelernter; Linda in context, Comm. of the ACM 32 (1989), 444–458Google Scholar
  16. [ChaMis]
    K.M. Chandy, J. Misra; "Parallel program design", Addison-Wesley Pub. Co., Reading, Mass., 1988Google Scholar
  17. [Cli]
    W.D.Clinger; Foundations of actor semantics, Ph.D.Thesis, Technical Report 633, MIT AI Lab, 1981Google Scholar
  18. [DecMicPomSim]
    F.De Cindio, G.De Michelis, L.Pomello, C.Simone; Superposed Automata nets, in "Application and Theory of Petri Nets" (C.Girault, W.Reisig, eds.), IFB 52, Springer-Verlag, 1982Google Scholar
  19. [DegNicMon]
    P. Degano, R. DeNicola, U. Montanari; A distributed operational semantics for CCS based on Condition/Event systems, Acta Informatica 26 (1988), 59–92Google Scholar
  20. [DerJouLor]
    P. Deransart, M. Jourdan, B. Lorho; "Attribute Grammars; Definitons, Systems and Bibliography", Lecture Notes in Computer Science 323, Springer-Verlag, Berlin, 1988Google Scholar
  21. [Dijk]
    E.W. Dijkstra; "A discipline of programming", Prentice-Hall, Englewood Cliffs, N.J., 1976Google Scholar
  22. [EngLeiRozl]
    J.Engelfriet, G.Leih, G.Rozenberg; Parallel object-based systems and Petri nets, Technical Reports 90-04 and 90-05, Leiden University, 1990Google Scholar
  23. [EngLeiRoz2]
    J. Engelfriet, G. Leih, G. Rozenberg; Formalizing the behaviour of parallel object-based systems by Petri nets, in "Semantics for Concurrency, Leicester 1990" (eds. M.Z. Kwiatkowska, M.W. Shields, R.M. Thomas), Workshops in Computing, Springer-Verlag, Berlin, 1990, 204–221Google Scholar
  24. [FinBil]
    G. Findlow, J. Billington; High-level nets for dynamic dining philosophers systems, in "Semantics for Concurrency, Leicester 1990" (eds. M.Z. Kwiatkowska, M.W. Shields, R.M. Thomas), Workshops in Computing, Springer-Verlag, Berlin, 1990, 185–203Google Scholar
  25. [GenLau]
    H.J. Genrich, K. Lautenbach; System modelling with high-level Petri nets, Theor. Comput. Sci. 13 (1981), 109–136Google Scholar
  26. [Gol]
    U. Goltz; On representing CCS programs by finite Petri nets, in Proc. of Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 324, Springer-Verlag, Berlin, 1988, 339–350Google Scholar
  27. [GolRei]
    U. Goltz, W. Reisig; The non-sequential behaviour of Petri nets, Inform. and Control 57 (1983), 125–147Google Scholar
  28. [Hew]
    C. Hewitt; Viewing control structures as patterns of passing messages, Journal of Artificial Intelligence 8 (1977), 323–364Google Scholar
  29. [HewBak1]
    C.Hewitt, H.Baker; Laws for communicating parallel processes, IFIP-77, Toronto, 1977, 987–992Google Scholar
  30. [HewBak2]
    C.Hewitt, H.Baker; Actors and continuous functionals, Formal Description of Progr. Concepts, 1977, 367–390Google Scholar
  31. [Hoa]
    C.A.R. Hoare; Communicating sequential processes, Comm. of the ACM 21 (1978), 666–677Google Scholar
  32. [Hot]
    G. Hotz; Eine Algebraisierung des Sytheseproblems von Schaltkreisen, EIK 1 (1965), 185–205 and 209–231Google Scholar
  33. [JanRoz1]
    D. Janssens, G. Rozenberg; Basic notions of actor grammars: a graph grammar model for actor computation, in Graph-grammars and their application to computer science, Lecture Notes in Computer Science 291, Springer-Verlag, Berlin, 1987, 280–298Google Scholar
  34. [JanRoz2]
    D. Janssens, G. Rozenberg; Actor grammars, Math. Syst. Theory 22 (1989), 75–107Google Scholar
  35. [Knu]
    D.E. Knuth; Semantics of context-free languages, Math. Syst. Theory 2 (1968), 127–145; Correction: Math.Syst. Theory 5 (1971), 95–96Google Scholar
  36. [Lei1]
    G. Leih; Actor graph grammars and POOL2, Document no.PO396, Philips Research Laboratories, Eindhoven, 1988Google Scholar
  37. [Lei2]
    G. Leih; Object-based graph grammars and Petri nets, Technical Report 90-21, Leiden University, 1990Google Scholar
  38. [Mes1]
    J.Meseguer; Rewriting as a unified model of concurrency, Technical Report SRI-CSL-90-02, SRI International, 1990 (an abstract will appear in LNCS, Proc. Concur '90, Amsterdam)Google Scholar
  39. [Mes2]
    J.Meseguer; A logical theory of concurrent objects, Technical Report SRI-CSL-90-07, SRI International, to appear in ACM Proc. ECOOP/OOPSLA '90, OttawaGoogle Scholar
  40. [Mey]
    B.Meyer; "Object-oriented Software Construction", Prentice Hall, 1988Google Scholar
  41. [Rei]
    W. Reisig; "Petri nets: an introduction", EATCS Monographs on Theoretical Computer Science Vol.4, Springer-Verlag, Berlin, 1985Google Scholar
  42. [Roz]
    G.Rozenberg; Behaviour of elementary net systems, in [BraReiRoz], 60–94Google Scholar
  43. [Rut]
    J.J.M.M. Rutten; Semantic correctness for a parallel object-oriented language, SIAM J. on Computing 19 (1990), 341–383Google Scholar
  44. [Tau]
    D. Taubner; "Finite representations of CCS and TCSP programs by automata and Petri nets", Lecture Notes in Computer Science 369, Springer-Verlag, Berlin, 1989Google Scholar
  45. [Wat]
    D.A.Watt; Contextual constraints, in "Methods and tools for compiler construction" (B.Lorho, ed.), Cambridge University Press, 1984Google Scholar
  46. [Weg]
    P. Wegner; Learning the language, Byte Vol.14 No.3, March 1989, 245–253Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Joost Engelfriet
    • 1
  • George Leih
    • 1
  • Grzegorz Rozenberg
    • 1
  1. 1.Department of Computer ScienceLeiden UniversityLeidenThe Netherlands

Personalised recommendations