Robustness of deadlock avoidance algorithms for sequential processes.

DOI10.1016/S0005-1098(03)00176-6zbMath1041.90014OpenAlexW1973855314MaRDI QIDQ1413928

Fu-Shiung Hsieh

Publication date: 17 November 2003

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0005-1098(03)00176-6

zbMATH Keywords

AlgorithmsFlexible manufacturing systemsRobustnessDeadlock

Mathematics Subject Classification ID

Production models (90B30) Discrete event control/observation systems (93C65) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Approximation algorithms (68W25)

Related Items (9)

Robustness analysis of Petri nets for assembly/disassembly processes with unreliable resources ⋮ Liveness enforcing supervisory policies tolerant to controllability failures for discrete-event systems modeled by Petri nets ⋮ Two-stage design method of robust deadlock control for automated manufacturing systems with a type of unreliable resources ⋮ Robustness of deadlock control for a class of Petri nets with unreliable resources ⋮ Robustness analysis of non-ordinary Petri nets for flexible assembly/disassembly processes based on structural decomposition ⋮ Robust deadlock control for automated manufacturing systems with an unreliable resource ⋮ Robustness analysis of non-ordinary Petri nets for flexible assembly systems ⋮ Polynomial-complexity robust deadlock controllers for a class of automated manufacturing systems with unreliable resources using Petri nets ⋮ A survey of siphons in Petri nets

Cites Work

• A review of synthesis techniques for Petri nets with applications to automated manufacturing systems
• Polynomial-complexity deadlock avoidance policies for sequential resource allocation systems

This page was built for publication: Robustness of deadlock avoidance algorithms for sequential processes.