Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets

Abstract : Join-Free Petri nets, whose transitions have at most one input place, model systems without synchronizations, while Choice-Free Petri nets, whose places have at most one output transition, model systems without conflicts. These classes respectively encompass the state machines (S-systems) and the marked graphs (T-systems). Whereas a structurally bounded and structurally live Petri net is said to be "well-formed", a bounded and live Petri net is said to be "well-behaved". Necessary and sufficient conditions for the well-formedness of Join-Free and Choice-Free nets have been known for some time, yet the behavioral properties of these classes are still not well understood. In particular polynomial sufficient conditions for liveness, that is, polynomial in time and with a polynomial initial number of tokens, have not been found until now. Besides, home markings, which can be reached from every reachable marking thus allowing for the construction of systems that can return to their initial data distribution, are not well apprehended either for these subclasses. We extend results on weighted T-systems to the class of weighted Petri nets and present transformations which preserve the language of the system and reduce the initial marking. We introduce a notion of balancing that makes possible the transformation of conservative systems into so-called "token-conservative" systems, whose number of tokens is invariant, while retaining the feasible transition sequences. This transformation is pertinent for all well-formed Petri nets and leads to polynomial sufficient conditions of liveness for well-formed Join-Free and Choice-Free nets. Finally, we also provide polynomial live and home markings for Fork-Attribution systems.
Complete list of metadatas

https://hal.sorbonne-universite.fr/hal-01053867
Contributor : Thomas Hujsa <>
Submitted on : Sunday, August 3, 2014 - 11:42:35 AM
Last modification on : Sunday, August 4, 2019 - 1:19:58 AM

Identifiers

Citation

Thomas Hujsa, Jean-Marc Delosme, Alix Munier-Kordon. Polynomial Sufficient Conditions of Well-Behavedness and Home Markings in Subclasses of Weighted Petri Nets. ACM Transactions on Embedded Computing Systems (TECS), ACM, 2014, 13 (4), pp.141:1--141:25. ⟨10.1145/2627349⟩. ⟨hal-01053867⟩

Share

Metrics

Record views

418