Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
5. References
F. Commoner, Deadlocks in Petri nets, Technical Report CA-7206-2311, Massachusetts Computer Associates, June 1970.
F. Commoner, et. al., Marked directed graphs, Journal of Computer and System Sciences 5(5) (October 1971) 511–523.
A. Datta and S. Ghosh, Synthesis of a class of deadlock-free Petri nets, Journal of the ACM 31(3) (July 1984) 486–506.
H. J. Genrich and K. Lautenbach, Synchronisationsgraphen, Acta Informatica 2(2) (1973) 143–161.
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.
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.
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.
K. Lautenbach, Liveness in Petri nets, Internal Report ISF-75-02.1, GMD, Bonn, West Germany, July 1975.
J. L. Peterson, Petri Net Theory and the Modeling of Systems (Prentice-Hall, 1981).
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Datta, A.K., Ghosh, S. (1986). Modular synthesis of deadlock-free control structures. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1986. Lecture Notes in Computer Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17179-7_18
Download citation
DOI: https://doi.org/10.1007/3-540-17179-7_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17179-9
Online ISBN: 978-3-540-47239-1
eBook Packages: Springer Book Archive