Abstract
The paper defines two notions of composition of concurrent modules modelled by means of Petri nets: synchronisations and fusions. We study these two notions for the class of Free Choice nets, and characterise the compositions (within this class) that preserve liveness (absence of partial or global deadlocks) and boundedness (absence of overflows in finite stores). The characterisation shows which structures must be avoided in order to preserve the properties.
This work was partially supported by the DEMON Esprit Basic Research Action 3148 and the Spanish Plan Nacional de Investigación, Grant TIC-0358/89.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Best, E.; Desel, J. 1990: Partial Order Behaviour and Structure of Petri Nets. Formal Aspects of Computing Vol.2 No.2, 123–138.
Best, E. 1987: Structure Theory of Petri Nets: the Free Choice Hiatus. Advanced Course on Petri Nets / Brauer, Reisig, Rozenberg (eds.), LNCS 254 and 255, pp. 168–205.
Best, E.; Thiagarajan, P.S. 1987: Some Classes of Live and Safe Petri Nets. Concurrency and Nets / Voss, K.; Genrich, H.J., Rozenberg, G. (eds.). — Berlin: Springer-Verlag, pp. 71–94.
Desel, J.: A structural property of Free-choice systems. Newsletter of the GI Special Interest Group in Petri Nets and Related System Models, No. 25, pp.16–20.
Esparza, J.: Structure Theory of Free Choice nets. Ph. D. Thesis, Departamento de Ingeniería Eléctrica e Informática, Universidad de Zaragoza, June.
Esparza, J. 1990: Synthesis Rules for Petri Nets, and How They Lead to New Results. CONCUR'90 / Baeten, Klop, (eds.), LNCS 458, pp.182–198.
Esparza, J.; Silva, M.: Handles in Petri Nets. Hildesheimer Informatik Fachbericht, 3–91.
Esparza, J.; Silva, M.: Top-down Synthesis of Live and Bounded Free Choice nets. Proceedings of the XIth. International Conference on Application and Theory of Petri nets. Paris, June, pp. 63–83. To appear in Advances in Petri Nets 91.
Genrich, H.J.; Jannsens, D.; Rosenberg, G.; Thiagarajan, P.S. 1983: Petri Nets and Their Relation to Graph Grammars. 2nd Int. Workshop on Graph Grammars and their Application to Computer Science. LNCS 153, pp. 115–129.
Hack, M.H.T. 1972: Analysis of Production Schemata by Petri Nets. Cambridge, Mass.: MIT, Dept. Electrical Engineering, MS Thesis. Corrected June 1974
Silva, M. 1987: Towards a Synchrony Theory for P/T Nets. Concurrency and Nets / Voss, K.; Genrich, H.J., Rozenberg, G. (eds.). — Berlin: Springer-Verlag, pp. 71–94.
Thiagarajan, P.S.; Voss, K. 1984: A Fresh look at free Choice Nets. Information and Control, Vol. 61, No. 2, May, pp. 85–113.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Esparza, J., Silva, M. (1991). Compositional synthesis of live and bounded free choice Petri nets. In: Baeten, J.C.M., Groote, J.F. (eds) CONCUR '91. CONCUR 1991. Lecture Notes in Computer Science, vol 527. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54430-5_88
Download citation
DOI: https://doi.org/10.1007/3-540-54430-5_88
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54430-2
Online ISBN: 978-3-540-38357-4
eBook Packages: Springer Book Archive