Rechercher

[YSH18] Liveness Enforcement for a Class of Petri Nets via Resource Allocation

Conférence Internationale avec comité de lecture : 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC), October 2018, pp.4369-4374, Miyazaki, Japan, (DOI: 10.1109/SMC.2018.00738)

Mots clés: Liveness Enforcement; WS3PR Nets, Resource Allocation

Résumé: This work focuses on a class of Petri nets (PNs) called Weighted Systems of Simple Sequential Processes with Resources (WS3PR). We study how to enforce liveness to WS3PR by appropriately allocating resources. A sufficient condition that guarantees liveness of a net system in this class is first derived. Then, based on such a condition, we propose an algorithm that computes an initial marking of resource places that guarantees the liveness of a WS3PR system where the initial marking of the idle places is given. Note that, we do not guarantee that the resulting solution is optimal, in the sense that a smaller initial marking of resource places that still leads to liveness could exist. However, several numerical examples show that the solution resulting from the proposed approach is optimal.

BibTeX

@inproceedings {
YSH18,
title="{Liveness Enforcement for a Class of Petri Nets via Resource Allocation}",
author=" D. You and W. Shouguang and D. Hao and D. Wenli and K. Barkaoui and C. Seatzu ",
booktitle="{ 2018 IEEE International Conference on Systems, Man, and Cybernetics (SMC)}",
year=2018,
edition="IEEE",
month="October",
pages="4369-4374",
address="Miyazaki, Japan",
doi="10.1109/SMC.2018.00738",
}