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

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Robust control reconfiguration of resource allocation systems with Petri nets and integer programming
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
On the enforcement of a class of nonlinear constraints on Petri nets
Supervisory control of discrete-event systems
Analysis of strong and strong periodic detectability of bounded labeled Petri nets
Supervisory control of a class of Petri nets with unobservable and uncontrollable transitions
Marking diagnosability verification in labeled Petri nets
Introduction to Discrete Event Systems
On liveness and controlled siphons in Petri nets
Liveness-Enforcing Supervision in AMS-Oriented HAMGs: An Approach Based on New Characterization of Siphons Using Petri Nets
Noninterference Enforcement via Supervisory Control in Bounded Petri Nets
The Reachability Problem for Petri Nets Is Not Elementary
Feedback control logic for forbidden-state problems of marked graphs: application to a real manufacturing system
Feedback Control Logic for Backward Conflict Free Choice Nets
Basis Marking Representation of Petri Net Reachability Spaces and Its Application to the Reachability Problem
Verification of State-Based Opacity Using Petri Nets
Depth-First Search and Linear Graph Algorithms
On Liveness Enforcing Supervisory Policies for Arbitrary Petri Nets
Marking Estimation in Petri Nets Using Hierarchical Basis Reachability Graphs
A Class of Well Structured Petri Nets for Flexible Manufacturing Systems

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