Composition of nets via a communication medium

  • Younes Souissi
  • Gérard Memmi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 483)


The general idea of this paper is to build a system in a modular way and to deduce its properties only by analysing its smaller components. Since, in general, composing subnets does not preserve properties (especially liveness) at the level of the global net, the problem is to find constraints on the subnets for establishing such results. We have discovered that in some cases it is sufficient to put structural constraints (instead of constraints on the subnets languages) only on the medium, that is the subnet generated by the elements (places and transitions) shared by the two nets to be composed. Our theoretical study includes as media of communication: places (one way communication), a rendez-vous, a sequential process, and finally a well-formed block.


Composition via shared places separation line composition via a sequential process composition by rendez-vous composition via a well-formed block boundedness liveness 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Allégre...86]
    J.P.Allégre and N. Bobichon: "Etude de Réseaux de Petri par Décomposition." Projet de fin d'etude. E.N.S.T. Paris 1986.Google Scholar
  2. [André 82]
    C.André: "Use of The Behaviour Equivalence in Place-Transition Net Analysis." IFB 52, Springer (1982).Google Scholar
  3. [André 83]
    C. André: "The Behaviour of a Petri Net on a Subset of Transitions." RAIRO Autom. 17, pp 5–21 (1983).Google Scholar
  4. [Baumgarten 88]
    B. Baumgarten: "On Internal and External characterizations of PT-nets Building Block Behaviour." Advances in Petri nets, LNCS 340, pp 44–61, 1988.Google Scholar
  5. [Berge 83]
    C. Berge: "Graphes", Gauthiers-villars, Paris 1983.Google Scholar
  6. [Berthelot 83]
    G. Berthelot: "Transformations de Réseaux de Petri." T.S.I.,Vol. 4, n. 1,pp 91–101, Paris 1985.Google Scholar
  7. [Berthelot 85]
    G. Berthelot: "Transformations and Decompositions of Nets.", Advances in Petri Nets, LNCS 254, pp 359–376, 1986.Google Scholar
  8. [BRAMS 83]
    G.W. BRAMS: "Réseaux de Petri: Theorie et Pratique.", Masson, Paris, 1983.Google Scholar
  9. [Commoner 72]
    F.Commoner: "Deadlock in Petri Nets.", Applied Data Research Inc. Wakefiels Mass. CA 7206-2311, 1972.Google Scholar
  10. [Dagron...86]
    N. Dagron and G. Memmi: "On the Composition of Live Subnets." FOR ME TOO (BULL), Esprit project 283, Task DMC.ICPP1; march 1987.Google Scholar
  11. [Fraisse 86]
    P.Fraisse: "Longs Cycles dans les Graphes. Application aux Réseaux de Petri.", thèse de docteur en sciences. Université de Paris-sud. centre d'Orsay. 1986.Google Scholar
  12. [Hack 72]
    M.Hack: "Analysis of Production Schemata by Petri Nets." M.S. thesis, Dept. Electrical Engineering. M.I.T. Cambridge Mass. Project MAC-TR 94, 1972.Google Scholar
  13. [Jensen 82]
    K. Jensen: "High Level Petri Nets". Proc. of the third European Workshop on Application and Theory of Petri Nets. Varenne, Italy, June 1982.Google Scholar
  14. [Memmi 78]
    G. Memmi: "Fuites et Semi-flots dans les Réseaux de Petri.", thèse de docteur-ingenieur. Paris VI, 1978.Google Scholar
  15. [Memmi 83]
    G.Memmi: "Methodes d'Analyse des Réseaux de Petri, Réseaux à Files et Application aux Systèmes Temps Reels.",thèse d'état, Paris VI, 1983.Google Scholar
  16. [Pomello 88]
    L.Pomello: "Some Equivalence Notions for Concurrent Systems, An Overview". G.Rozenberg (ed.): Advances in Petri Nets'85, LNCS 222, 1986.Google Scholar
  17. [Reisig 82]
    W.Reisig: "Deterministic Buffer Synchronisation of Sequential Processes.", Acta Informatica 18, 1982.Google Scholar
  18. [Reisig...83]
    W. Reisig, G. Berthelot and G. Memmi: "A Control Structure for Sequential Processes Synchronized by Buffers.", Proc. of the 4th European Work. on App. and Th. of Petri nets, Toulouse, France 1983.Google Scholar
  19. [Souissi...88]
    Y.Souissi and N.Beldiceanu: "Deterministic Systems of Sequential Processes: Theory and Tools.", Concurrency 88, LNCS 335, pp 380–400, Springer-Verlag.Google Scholar
  20. [Souissi 90a]
    Y. Souissi: "Préservation de Propriétés par Composition de Réseaux de Petri. Extension aux Réseaux à Files et Application aux Protocoles de Communication" Thèse de l'Université de Paris VI. February 1990.Google Scholar
  21. [Souissi 90b]
    Y. Souissi: "On Liveness Preservation by Composition of Nets via a Set of Places" Proc. of the XIth Int. Conf. on Application and Theory of Petri Nets. Paris, June 1990.Google Scholar
  22. [Souissi 90c]
    Y. Souissi: "A Modular Approach for the Validation of Communication Protocols Using Fifo Nets". Proc. of the Xth Int. Symposium on Protocol Specification Testing and Verification. Ottawa, 13–15 June 1990.Google Scholar
  23. [Suzuki...82]
    I.Suzuki and T.Murata: "Stepwise Refinements of Transitions and Places.", IFB52, C.Girault and W.Reisig (ed.), pp136–141, 1982.Google Scholar
  24. [Valette 79]
    R. Valette: "Analysis of Petri nets by Stepwise Refinements." J.C.S.S 18 pp 35–46, 1979.Google Scholar
  25. [Vogler 88]
    W.Vogler: "Failures Semantics and Deadlocking of Modular Petri Nets.MFCS 88, LNCS 324.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Younes Souissi
    • 1
  • Gérard Memmi
    • 1
  1. 1.Bull Research and Advanced ProgramsLouveciennesFrance

Personalised recommendations