Robust Deadlock Control for Automated Manufacturing Systems With Unreliable Resources Based on Petri Net Reachability Graphs

Liu, Gaiyun; Li, Pei; Li, Zhiwu; Wu, Naiqi

doi:10.1109/tsmc.2018.2815618

Cited by 89 publications

(74 citation statements)

References 55 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that the Petri net reduction techniques originally reported in Murata 40 can be used for state-space reduction, as did by Uzam. 28 In this article, we can use this method to simplify a plant model first if the reduction rules in Murata 40 are applicable. For example, the net shown in Figure 13 with 26 places can be reduced as shown in Figure 17.…”

Section: Experiments Results and Analysismentioning

confidence: 99%

On state-space compression and state reachability retrieval of Petri nets

Ren

Liang

et al. 2019

Advances in Mechanical Engineering

View full text Add to dashboard Cite

The problem of state-space explosion and state reachability decision has been a focus in Petri net analysis. In this article, some algorithms based on data features of state space are proposed for state-space reduction and reachability analysis in Petri nets. A caching arrangement algorithm for the state reachability graph is proposed to alleviate the memory overhead when all states are generated by a traditional reachability graph generation algorithm. For the reduction of the state space, a compression algorithm based on a hybrid coding is formulated. The changing characteristics of state elements are fully utilized to realize a sharp reduction of the whole state space. For the state reachability analysis, a state reachability retrieval algorithm based on the locally sensitive hashing is reported. In this algorithm, all the states in the compressed state space are distributed to different hash buckets according to the distances among the states, which realize the primary state retrieval efficiently. Then, a state retrieval strategy that reverts the primary retrieved state to its original data is adopted. Finally, the proposed compression and retrieval algorithms are validated on several Petri net models, showing high compression efficiency and exact accuracy of state retrieval.

show abstract

Section: Experiments Results and Analysismentioning

confidence: 99%

On state-space compression and state reachability retrieval of Petri nets

Ren

Liang

et al. 2019

Advances in Mechanical Engineering

View full text Add to dashboard Cite

show abstract

“…In SCT, both the plant and requirements are specified in formal models, such as finite state automata [3], [4] and Petri nets [5]- [7]; however, the formal models of the reused components are often unknown in realistic systems. Since the source code of the reused components is unavailable, it is difficult to obtain a logical model for the system by analyzing its source code [4].…”

Section: Introductionmentioning

confidence: 99%

Control of Black-Box Embedded Systems by Integrating Automaton Learning and Supervisory Control Theory of Discrete-Event Systems

Zhang

Feng

2020

IEEE Trans. Automat. Sci. Eng.

Self Cite

View full text Add to dashboard Cite

The paper presents an approach to the control of black-box embedded systems by integrating automaton learning and supervisory control theory (SCT) of discrete-event systems (DES), where automaton models of both the system and requirements are unavailable or hard to obtain. First, the system is tested against the requirements. If all the requirements are satisfied, no supervisor is needed and the process terminates. Otherwise, a supervisor is synthesized to enforce the system to satisfy the requirements. To apply SCT and automaton learning technologies efficiently, the system is abstracted to be a finite-discrete model. Then, a C * learning algorithm is proposed based on the classical L * algorithm to infer a Moore automaton describing both the behavior of the system and the conjunctive behavior of the system and the requirements. Subsequently, a supervisor for the system is derived from the learned Moore automaton and patched on the system. Finally, the controlled system is tested again to check the correctness of the supervisor. If the requirements are still not satisfied, a larger Moore automaton is learned and a refined supervisor is synthesized. The whole process iterates until the requirements hold in the controlled system. The effectiveness of the proposed approach is manifested through two realistic case studies. Note to Practitioners-Supervisory control theory of DES can synthesize maximally permissive supervisory controllers to ensure the correctness of software-controlled processes. The applicationManuscript of supervisory control theory relies on automaton models of the plant and specifications; however, the required models are often unavailable and difficult to obtain for black-box embedded systems. Automaton learning is an effective method for inferring models of black-box systems. This paper integrates the two technologies so that the supervisory control theory is applicable to the development of black-box embedded software systems. The proposed approach is implemented in a toolchain that connects automaton learning algorithms, SCT, and testing algorithms via scripts. The obtained supervisor is implemented as a software patch to monitor and control the original system online.Index Terms-Automaton learning algorithm, black-box embedded system, software testing, supervisory control theory.

show abstract

“…Petri nets are one of the typical mathematical models of DESs. The distributed nature and structural properties of Petri nets play an important role in solving various problems of DESs, including supervisory control [3]- [8], performance optimization [9]- [13], and big data [14]- [17]. In this paper, we address the fault diagnosis issue of a class of Petri nets.…”

Section: Introduction a Backgroundmentioning

confidence: 99%

Fault Diagnosis of Backward Conflict-Free Petri Nets by Generalized Markings

Wang

Zhu

2020

IEEE Access

Self Cite

View full text Add to dashboard Cite

This paper addresses the fault diagnosis problem in discrete event systems using backward conflict-free Petri nets, where two different transitions have no common output places. The notion of generalized markings is employed, where the number of tokens in a place can be negative. Based on the special structures of backward conflict-free Petri nets and the generalized marking corresponding to an observed transition sequence, an integer linear programming (ILP) problem is constructed where the numbers of unknown integer variables and constraints are independent of the length of the observed transition sequence. A diagnosis algorithm is proposed by associating two different objective functions with the ILP problem and solving it. The computational efficiency of the proposed algorithm depends on the net structure only, regardless of the length of an observed transition sequence. INDEX TERMS Fault diagnosis, Petri net, backward conflict-free net, generalized marking.

show abstract

Robust Deadlock Control for Automated Manufacturing Systems With Unreliable Resources Based on Petri Net Reachability Graphs

Cited by 89 publications

References 55 publications

On state-space compression and state reachability retrieval of Petri nets

On state-space compression and state reachability retrieval of Petri nets

Control of Black-Box Embedded Systems by Integrating Automaton Learning and Supervisory Control Theory of Discrete-Event Systems

Fault Diagnosis of Backward Conflict-Free Petri Nets by Generalized Markings

Contact Info

Product

Resources

About