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.
[1]
Richard M. Karp,et al.
Parallel Program Schemata
,
1969,
J. Comput. Syst. Sci..
[2]
Gérard Berthelot.
Transformations and Decompositions of Nets
,
1986
.
[3]
Nicolas Beldiceanu,et al.
Deterministic Systems of Sequential Processes: Theory and Tools
,
1988,
Concurrency.
[4]
Manuel Silva Suárez,et al.
Improving the linearly based characterization of P/T nets
,
1991,
Applications and Theory of Petri Nets.
[5]
Gérard Memmi,et al.
Composition of nets via a communication medium
,
1991,
Applications and Theory of Petri Nets.
[6]
Javier Esparza,et al.
Minimal deadlocks in free choice nets
,
1989
.
[7]
Y. Souissi.
Preservation de proprietes par composition de reseaux de petri. Extension aux reseaux a files. Application aux protocoles de communication
,
1990
.