Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs

DOI10.1016/J.AUTOMATICA.2024.111625MaRDI QIDQ6550220zbMATH OpenFDO

Authors Chao Gu, Ziyue Ma, Zhiwu Li

Publication date 5 June 2024

Published in Automatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AUTOMATICA.2024.111625

zbMATH Keywords

basis reachability graphdeadlock-freenesslivenessPetri net

Mathematics Subject Classification ID

Attainable sets, reachability (93B03) Discrete event control/observation systems (93C65)

Recommendations

• scientific article; zbMATH DE number 1756008
• On the existence of supervisory policies that enforce liveness in discrete-event dynamic systems modeled by controlled Petri nets
• scientific article; zbMATH DE number 1696458
• On liveness and controlled siphons in Petri nets
• Necessary and sufficient liveness condition of GS³PR Petri nets

Cites work

• A Class of Well Structured Petri Nets for Flexible Manufacturing Systems
• Analysis of strong and strong periodic detectability of bounded labeled Petri nets
• Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
• Depth-First Search and Linear Graph Algorithms
• Design of a maximally permissive liveness-enforcing supervisor with a compressed supervisory structure for flexible manufacturing systems
• Fault detection for discrete event systems using Petri nets with unobservable transitions
• Feedback Control Logic for Backward Conflict Free Choice Nets
• Feedback control logic for forbidden-state problems of marked graphs: application to a real manufacturing system
• scientific article; zbMATH DE number 3980500 (Why is no real title available?)
• scientific article; zbMATH DE number 1302047 (Why is no real title available?)
• scientific article; zbMATH DE number 1302048 (Why is no real title available?)
• Introduction to Discrete Event Systems
• Liveness-Enforcing Supervision in AMS-Oriented HAMGs: An Approach Based on New Characterization of Siphons Using Petri Nets
• Marking diagnosability verification in labeled Petri nets
• Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs
• Noninterference Enforcement via Supervisory Control in Bounded Petri Nets
• On liveness and controlled siphons in Petri nets
• On Liveness Enforcing Supervisory Policies for Arbitrary Petri Nets
• On the enforcement of a class of nonlinear constraints on Petri nets
• Robust control reconfiguration of resource allocation systems with Petri nets and integer programming
• Supervisory control of a class of Petri nets with unobservable and uncontrollable transitions
• Supervisory control of discrete-event systems
• The Reachability Problem for Petri Nets Is Not Elementary
• Verification of State-Based Opacity Using Petri Nets

Cited in

(1)

• Efficient iterative deadlock prevention for flexible manufacturing systems utilizing modified resource requirement graphs

This page was built for publication: Liveness and deadlock-freeness verification and enforcement in bounded Petri nets using basis reachability graphs

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