On the Equivalence Between Robustness and Liveness in Automated Manufacturing Systems

There are two foundational problems in automated manufacturing systems. One is to determine their robustness (i.e., checking whether a marking is robust or nonrobust) while the other is to determine their liveness (i.e., determining whether a marking is live, bad, deadlock, or livelock). However, existing methods deal with them separately. This renders the existing methods inefficient in practice. In this article, we investigate the relation between robustness and liveness. First, we show how to define robustness in different net systems, i.e., the live, bounded, and nonreversible or reversible net systems. Second, we present a reachability graph-based method to assess the robustness of markings. Third, we clarify the relation between robustness and liveness, and conclude that liveness is a special case of robustness, under which the set of unreliable transitions is null. As a result, the robustness determination method developed in this article proves to be much general and can be used to check the liveness of each marking.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Systems Man and Cybernetics Systems
Published
2024-09-27
DOI
https://doi.org/10.1109/tsmc.2024.3458939
Citations
3
Primary Topic
Scheduling and Optimization Algorithms
Type
article
Field-Weighted Citation Impact
1.05

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On the Equivalence Between Robustness and Liveness in Automated Manufacturing Systems

Hesuan Hu, Benyuan Yang
3 citations
IEEE Transactions on Systems Man and Cybernetics Systems
Scheduling and Optimization Algorithms
1.05
article

On the Equivalence Between Robustness and Liveness in Automated Manufacturing Systems

Hesuan Hu, Benyuan Yang
article en
3 citations

Abstract

There are two foundational problems in automated manufacturing systems. One is to determine their robustness (i.e., checking whether a marking is robust or nonrobust) while the other is to determine their liveness (i.e., determining whether a marking is live, bad, deadlock, or livelock). However, existing methods deal with them separately. This renders the existing methods inefficient in practice. In this article, we investigate the relation between robustness and liveness. First, we show how to define robustness in different net systems, i.e., the live, bounded, and nonreversible or reversible net systems. Second, we present a reachability graph-based method to assess the robustness of markings. Third, we clarify the relation between robustness and liveness, and conclude that liveness is a special case of robustness, under which the set of unreliable transitions is null. As a result, the robustness determination method developed in this article proves to be much general and can be used to check the liveness of each marking.

IEEE Transactions on Systems Man and Cybernetics SystemsVol. 54(12)
Xidian University (CN), Soochow University (CN)
National Natural Science Foundation of China, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 20%
Scheduling and Optimization Algorithms
1.05
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.