Modular synthesis of deadlock-free control structures

  • Ajoy Kumar Datta
  • S. Ghosh
Session 5 Distributed Computing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 241)


This paper introduces a modular synthesis approach of arbitrarily large deadlock-free control structures. The synthesis rules are designed to preserve some properties of the modules. The properties preserved in the synthesized control structures are liveness and boundedness, the two most important properties of any control structure. This motivates to choose a model of the modules whose live-and-boundedness can be trivially assured. We introduce regular nets as the model of the modules, since the structure of these nets guarantees live-and-boundedness once the invariants are marked with tokens. The concept of net labeling plays a vital role in the present synthesis procedure. The boolean expressions, called net labels are attached to the transitions of the regular nets to define the synthesis rules for interconnecting the individual modules to form arbitrarily large live-and-bounded structure.

Key words

Petri nets deadlock regular nets synthesis 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. [1]
    F. Commoner, Deadlocks in Petri nets, Technical Report CA-7206-2311, Massachusetts Computer Associates, June 1970.Google Scholar
  2. [2]
    F. Commoner, et. al., Marked directed graphs, Journal of Computer and System Sciences 5(5) (October 1971) 511–523.Google Scholar
  3. [3]
    A. Datta and S. Ghosh, Synthesis of a class of deadlock-free Petri nets, Journal of the ACM 31(3) (July 1984) 486–506.Google Scholar
  4. [4]
    H. J. Genrich and K. Lautenbach, Synchronisationsgraphen, Acta Informatica 2(2) (1973) 143–161.Google Scholar
  5. [5]
    M. Hack, Analysis of production schemata by Petri nets, MS Thesis, MIT, Cambridge, MA, February 1972. Also Technical Report 94, Project MAC, MIT, Cambridge, MA, February 1972. Errata: "Correction to Analysis of production schemata by Petri nets", Computations Structures Group Note 17, Project MAC, MIT, Cambridge, MA, June 1974.Google Scholar
  6. [6]
    M. Hack, Decision problems for Petri nets and vector addition systems, Computation Structures Group Memo 95, Project MAC, MIT, Cambridge, MA, March 1974. Revised as Memo 95-1, August 1974. Also Technical Memo 59, Project MAC, MIT, Cambridge, MA, March 1975.Google Scholar
  7. [7]
    A. Holt, et. al., Final report of the information system theory project, Technical Report RADC-TR-68-305, Rome Air Development Center, Griffiss Air Force Base, New York, September 1968.Google Scholar
  8. [8]
    K. Lautenbach, Liveness in Petri nets, Internal Report ISF-75-02.1, GMD, Bonn, West Germany, July 1975.Google Scholar
  9. [9]
    J. L. Peterson, Petri Net Theory and the Modeling of Systems (Prentice-Hall, 1981).Google Scholar
  10. [10]
    C. A. Petri, Kommunikation mit automaten, PhD Thesis, University of Bonn, Bonn, West Germany, 1962. Also MIT Memo MAC-M-212, Project MAC, MIT, Cambridge, MA. Also Clifford F. Greene, Jr. (translator), "Communication with automata", Supplement 1 to Technical Report RADC-TR-65-377, Vol. 1, Rome Air Development Center, Griffiss Air Force Base, New York, January 1966.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Ajoy Kumar Datta
    • 1
  • S. Ghosh
    • 2
  1. 1.Computer Science Department College of Engineering and Applied SciencesArizona State UniversityTempeUSA
  2. 2.Computer CentreJadavpur UniversityCalcuttaIndia

Personalised recommendations