Ter-Chan Row

Prof. Dr. Ter-Chan Row

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 May 2023 in IEEE Access
Verified
Journal Article
Open access
TRTer-Chan Row
Ter-Chan Row
Yen-Liang PanYen-Liang Pan
Yen-Liang Pan
This paper focuses on studying and proposes deadlocks are an obstacle in the flexible manufacturing system (F.M.S.) of Petri nets (P.N.s) since their occurrence will influence the partial or whole model to stop working. Due to its structural characteristic, the Petri net is an essential model tool to overcome the deadlocks problem. The place invariant (P.I.) associated with the control algorithm to obtain the maximally permissive by deadlocks forbidding are popular recently; however, the algorithms have reached the maximal permissiveness, but their results are so complex. Our paper applies a single controller and single token to eliminate all the deadlocks in the F.M.S. of P.N.s. We combine the P.I. and simplified dead markings to form our single controller deadlock prevention policy (SCDPP) algorithm.

2 August 2023 in Processes
Verified
Journal Article
Open access
PDF file
TRTer-Chan Row
Ter-Chan Row
SLShih-Chih Lee
Shih-Chih Lee
Yen-Liang PanYen-Liang Pan
Yen-Liang Pan
In the flexible manufacturing system deadlock prevention domain, researchers’ almost final target is to seek the maximally permissive controllers for solving the deadlock problems of flexible manufacturing systems. However, it seems a challenging work. Whatever you adopt, what kinds of methods, policies, and strategies, it seems complicated to obtain optimal controllers for deadlock prevention even if they claim their algorithms are optimal until the deadlock recovery is developed. Therefore, many experts, including us, have decided to design all kinds of actual maximally permissive recovery policies based on control transitions. It is a pity that these policies usually solve some particular flexible manufacturing systems’ deadlock problems. The controllers failed to recover the deadlock situation of flexible manufacturing systems once the idle or resource places were changed. In other words, these policies could never know or identify the real number of maximally permissive controllers in the same structure with different idle places. The precise combination of the number of idle places is called the saturated line, and it divides the reachability states into two region (saturated region and unsaturated region). Accordingly, this paper proposes a novel concept that achieves the precise maximum permissiveness and fits all kinds of flexible manufacturing systems. The experimental results show how our policy does in practice.

11 December 2024 in IEEE Access
Verified
Journal Article
Open access
TRTer-Chan Row
Ter-Chan Row
CTChing-Yun Tseng
Ching-Yun Tseng
Yen-Liang PanYen-Liang Pan
Yen-Liang Pan
Deadlocks are a drawback when simulating in a Petri net model (PNM). Since the occurrence of deadlocks can influence serial operations, it is crucial to overcome such problems. The authors focus on resolving deadlocks by using superficial structural characteristics. The place invariant (PI) combines with our dead markings union and simplifies the algorithm to construct a single control place (CP) to eliminate the deadlocks. One uses a simple example to present the process steps in detail. Next, we eliminated the dead markings by two complex examples (a system of sequential systems with shared resources, S 4 PR) with our algorithm method. In contrast to the existing iterative methods with multiple controllers, the authors only use a single CP to resolve all the dead markings in a PNM, regardless of the complexity of the PNM. This is a new direction to handle the unordinary PNM prone to deadlocks.

8 September 2025 in Engineering Proceedings
Verified
Conference Paper
Open access
PDF file
SLShih-Chih Lee
Shih-Chih Lee
JCJui-Fu Cheng
Jui-Fu Cheng
TRTer-Chan Row
Ter-Chan Row
An iterative method was developed in this study within a Petri net system (PNS) for flexible manufacturing systems (FMSs) to eliminate deadlocks. The algorithm employs variant tokens, ranging from a few to many, in idle places to identify subnet deadlocks through reachability states. Additionally, it utilizes the place invariant (PI) to resolve deadlocks. An algorithm with a simple example was developed and applied using a complex scenario. The developed algorithm is user-friendly and effectively eliminates deadlocks in the PNS of FMSs, producing optimal results.

3 December 2024 in Applied Sciences
Verified
Journal Article
Open access
PDF file
TRTer-Chan Row
Ter-Chan Row
SLShih-Chih Lee
Shih-Chih Lee
CJCheng Jui-Fu
Cheng Jui-Fu
This study develops a timed Petri net (TPN)-based controller to mitigate traffic congestion resulting from sudden accidents by adapting traffic light sequences in real-time. The traditional traffic light signal (TLS) sequences are ineffective in resolving congestion from such accidents. To mitigate congestion, we propose immediately changing the sequence of TLSs at the traffic accident scene. Traffic accidents are categorized into three types (A-type, B-type and C-type) based on the direction in which they occur, and their traffic light sequences are designed according to their specific characteristics. By analyzing the timing of signal changes, ours proves to be more effective than traditional sequences in relieving traffic congestion.