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

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 n...

Fuld beskrivelse

Bibliografiske detaljer

Principais autores:	Hao Yue, Shulin Xu, Guangrui Zhou, Hesuan Hu, Yiyun Guo, Jihui Zhang
Format:	Artigo
Sprog:	Inglês
Udgivet:	IEEE 2019-01-01
Serier:	IEEE Access
Fag:	Basis reachability graph (BRG) discrete event system (DES) Petri net (PN) transition firing sequence
Online adgang:	https://ieeexplore.ieee.org/document/8892540/
Tags:	Tilføj Tag Ingen Tags, Vær først til at tagge denne postø!