Abstract
In this article, we define classes of Petri nets for which the composition via a set of places preserves liveness. The new notion on which the definition of these classes is based is F-monotonicity. F-monotonicity is a property which refines liveness monotonicity. F-robust nets are defined as nets which are insensitive to some modification of a weighted amount of tokens (marking of places P). A net which can be composed with an F-robust net on P, and which respects the degree of non-sensitivity of the F-robust net is said to be a non-disturbing net with regard to the F-robust net. Nets for which Commoner's property is a necessary and sufficient condition of liveness are shown to be F-robust. Nets with output places are also F-robust nets. The composition of an F-robust net with a non-disturbing net is shown to preserve liveness. F-strong nets constitute another class of nets that we can compose while preserving liveness. State machines are F-strong nets.
A part of this work has been done within the context of DEMON (Esprit II BRA 3148) project while the author was in Bull research centre.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Barkaoui and B. Lemaire: "An Effective Characterization of Minimal Deadlocks and Traps in Petri Nets Based on Graph Theory.", Proc. of the Xth International Conference on Application and Theory of Petri Nets, Bonn, 1989.
C. Berge: "Graphes", Gauthiers-villars, Paris 1983.
G. Berthelot: "Transformations and Decompositions of Nets.", Advances in Petri Nets, LNCS 254, pp 359–376, 1986.
G.W. BRAMS: "Réseaux de Petri: Théorie et Pratique.", Masson, Paris, 1983.
F.Commoner: "Deadlocks in Petri Nets.", Applied Data Research Inc. Wakefiels Mass. CA 7206-2311, 1972.
J.M. Colom and M. Silva:" Improving the Linearly Based Characterization of P/T Nets." Proc. Xth International Conference on Application and Theory of Petri Nets. Bonn, Germany, 1989.
J. Esparza, E. Best and M. Silva: "Minimal Deadlocks in Free Choice Nets.", DEMON (Esprit II BRA 3148) report, July 1989.
A.N. Holt and F. Commoner: "Events and Conditions.", Applied Data research Inc. New-York, 1970.
G.Memmi: "Méthodes d'Analyse des Réseaux de Petri, Réseaux à Files et Application aux Systèmes Temps Reels.", thèse d'état, Université Paris VI, 1983.
R. Karp, R. Miller: "Parallel Program Schemata." JCSS, V 3, pp 147–195, May 1969.
W.Reisig: "Deterministic Buffer Synchronization of Sequential Processes.", Acta Informatica 18, 1982.
M. Silva: "Las Redes de Petri en la Automatica y la Informatica.", Editoral AC, Madrid, 1985.
Y. Souissi and N. Beldiceanu: "Deterministic Systems of Sequential Processes: Theory and Tools.", Concurrency 88, LNCS 335, pp 38–400, Springer-Verlag, 1988.
Y.Souissi and G.Memmi: "Composition of Nets via a Communication Medium.", Proc. of the Xth International Conference on Application an Theory of Petri Nets, Bonn, June 1989. To appear in Advances in Petri Nets 90, G. Rozenberg ed., LNCS no ?, 1990.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Souissi, Y. (1991). On liveness preservation by composition of nets via a set of places. In: Rozenberg, G. (eds) Advances in Petri Nets 1991. ICATPN 1990. Lecture Notes in Computer Science, vol 524. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019979
Download citation
DOI: https://doi.org/10.1007/BFb0019979
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54398-5
Online ISBN: 978-3-540-47600-9
eBook Packages: Springer Book Archive