Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs

DOI10.1109/TAC.2020.2983088MaRDI QIDQ5854760zbMATH OpenOpenAlexFDO

Authors Ziyue Ma, Guanghui Zhu, Zhiwu Li

Publication date 12 March 2021

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tac.2020.2983088

Mathematics Subject Classification ID

Systems theory; control (93-XX)

Cited in

(8)

• Diagnosability enforcement in labeled Petri nets using supervisory control
• Probabilistic Marking Estimation in Labeled Petri Nets
• scientific article; zbMATH DE number 5079405 (Why is no real title available?)
• Analyzing Reachability for Some Petri Nets With Fast Growing Markings
• Least-cost transition sequence estimation in labelled time Petri net systems with unobservable transitions
• State estimation in labeled time Petri net systems using observed modified state class graph
• Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs
• Marking and firing transition estimation for partially observed Petri nets without observable transitions

This page was built for publication: Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854760)