Minimum Initial Marking Estimation in Labeled Petri Nets With Unobservable Transitions

Ruan, Keyu; Li, Lingxi; Wu, W.

doi:10.1109/access.2019.2894352

Cited by 8 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The drawback of the proposed approach is that the execution takes a long time. The results of MIM with observable transitions in [12] extended to the work [18] and an approach for MIM L-PN with unobservable transitions is proposed. In particular, it assumes that the PNs structure is given and the unobservable transitions in the net are contact-free.…”

Section: Related Workmentioning

confidence: 99%

A Rank Based ACO Approach for Optimal Resource Allocation and Scheduling in FMS Modeled with Labelled Petri Net

Jablaoui

Kmimech

Sliman

et al. 2021

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

In this article, we study the NP-Hard combinatorial optimization problem of the minimum initial marking (MIM) computation in labeled Petri net (L-PN) while considering a sequence of labels to minimize the resource consumption in a flexible manufacturing system (FMS), and we propose an approach based on the ant colony optimization (ACO) precisely the extension Rank-based ACO to optimal resource allocation and scheduling in FMS. The ACO meta-heuristic is inspired by the behavior of ants in foraging based on pheromones deposit. The numerical results show that the proposed algorithm obtained much better results than previous studies.

show abstract

Section: Related Workmentioning

confidence: 99%

A Rank Based ACO Approach for Optimal Resource Allocation and Scheduling in FMS Modeled with Labelled Petri Net

Jablaoui

Kmimech

Sliman

et al. 2021

Frontiers in Artificial Intelligence and Applications

View full text Add to dashboard Cite

show abstract

“…More recently, [18] proposes an extension of [2] with unobservable transitions, while introducing algorithms for the MIM estimation (MIM-UT). In particular, it assume that the Petri net structure is given and the unobservable transitions in the net are contact-free.…”

Section: B Related Workmentioning

confidence: 99%

“…In [18], heuristic based algorithms was developed to find the set of minimum initial markings with the complexity that is polynomial in the length of the observed label sequence. While being interesting, the proposed heuristic algorithms allows to find a partial/approximated set of solutions.…”

Section: B Related Workmentioning

confidence: 99%

Genetic-Based Approach for Minimum Initial Marking Estimation in Labeled Petri Nets

et al. 2020

View full text Add to dashboard Cite

Computing the minimum initial marking (MIM) in labeled Petri nets (PN) while considering a sequence of labels constitutes a difficult problem. The existing solutions of such a problem suffer from diverse limitations. In this paper, we proposed a new approach to automatically compute the MIM in labeled PNs in a timely fashion. We adopted a genetic-based algorithm to model the MIM problem. The choice of such an algorithm is justified by the nature of the MIM process which belongs to the NP-hard class. We experimentally showed the effectiveness of our approach and empirically studied the initial marking quality in particular.

show abstract

“…The work in [30] addressed the problem of minimum initial marking estimation in labeled PNs. More recently, the research results in [30] have been extended to labeled PNs with unobservable transitions [43]. By contrast, the transition firing sequences estimation is usually intended to find the least-cost firing sequences in a labeled PN based on a sequence of observed labels.…”

Section: Introductionmentioning

confidence: 99%

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Hao

Zhou

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper develops an approach for solving the problem of least-cost transition firing sequences estimation in labeled Petri nets with unobservable transitions. Each transition in the net is labeled as either observable or unobservable, and has a nonnegative cost. Additionally, we assume that the net system is bounded, the unobservable subnet is acyclic, and the cost of each unobservable transition is strictly positive. We propose the method mainly on the basis of the notions of basis marking and basis reachability graph (BRG), which is a compact representation of the reachability graph of the net system. By sacrificing extra storage space to keep the BRG and other necessary information in memory, some time-consuming computations are moved off-line. This makes our proposed approach more feasible for on-line applications. Finally, we present a brief survey and comparison of some representative methods that use labeled Petri nets as a formalism in the literature. INDEX TERMS Basis reachability graph (BRG), discrete event system (DES), Petri net (PN), transition firing sequence.

show abstract

Minimum Initial Marking Estimation in Labeled Petri Nets With Unobservable Transitions

Cited by 8 publications

References 20 publications

A Rank Based ACO Approach for Optimal Resource Allocation and Scheduling in FMS Modeled with Labelled Petri Net

A Rank Based ACO Approach for Optimal Resource Allocation and Scheduling in FMS Modeled with Labelled Petri Net

Genetic-Based Approach for Minimum Initial Marking Estimation in Labeled Petri Nets

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Contact Info

Product

Resources

About