Fault Identification of Discrete Event Systems Modeled by Petri Nets With Unobservable Transitions

Zhu, Guanghui; Li, Zhiwu; Wu, Naiqi; Al-Ahmari, Abdulrahman

doi:10.1109/tsmc.2017.2762823

Cited by 63 publications

(31 citation statements)

References 49 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The system is at a marker state when both I OBSERVATION TABLE I TABLE II OBSERVATION TABLE II machines have identical numbers of a i and b i . The alphabet of the system is = {a 1…”

Section: Illustrative Examplementioning

confidence: 99%

“…If some requirements of the new application are not satisfied in the reused component, it is impossible to amend the system by modifying its source code. Although fault identification methods [1], [2] can detect the violations, they cannot correct the errors online. An alternative approach is to use a "supervisor" component to monitor the reused component and correct it, if necessary.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

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

“…The system is at a marker state when both I OBSERVATION TABLE I TABLE II OBSERVATION TABLE II machines have identical numbers of a i and b i . The alphabet of the system is = {a 1…”

Section: Illustrative Examplementioning

confidence: 99%

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

show abstract

“…Deadlocks in FMSs can be dealt with by several tools: Graph theory [10], [11], [25], [47], automata [34], [35], [39], [45], [46], and Petri nets [11], [21], [28], [40], [44]. As a mathematical and graphical modeling tool, Petri nets are widely used to model and analyze the behavior of FMSs [6], [15], [22], [32], [36], [38].…”

Section: Introductionmentioning

confidence: 99%

An Efficient Deadlock Recovery Policy for Flexible Manufacturing Systems Modeled With Petri Nets

Yue

Chen

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper focuses on solving deadlock problems in flexible manufacturing systems modeled with Petri nets by adding a set of recovery transitions. Different from the traditional deadlock control policies that add control places to a net model, this paper employs transitions to recover all the deadlock markings to be legal ones. A live net system can be obtained with all reachable markings. First, according to reachability graph analysis, a set of recovery transitions is obtained for each deadlock marking to be recovered. Second, we present a vector intersection approach to compute a recovery transition to recover multiple deadlock markings. Then, an iterative method is developed to find a set of recovery transitions to recover all deadlock markings. At each iteration step, a recovery transition is found to recover more than one deadlock markings. This iterative method cannot obtain the minimal number of recovery transitions in theory, but it can usually lead to a minimal one supported by extensive experimental studies. Finally, several widely used examples are provided to demonstrate the presented approach. The experimental results show that the reported deadlock recovery technique is effective and efficient. INDEX TERMS Flexible manufacturing system, Petri net, deadlock, vector intersection.

show abstract

“…identification [59], [60], etc. PNs made a large number of significant contributions and are also considered as a good and suitable model for DESs because of their structural compactness, abundant algebraic analysis techniques, and more powerful modeling capabilities compared to automata [42], [44], [45], [58].…”

Section: Introductionmentioning

confidence: 99%

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Hao

Zhou

et al. 2019

IEEE Access

View full text Add to dashboard Cite

This paper develops an approach for solving the problem of least-cost transition firing sequences estimation in labeled Petri nets with unobservable transitions. Each transition in the net is labeled as either observable or unobservable, and has a nonnegative cost. Additionally, we assume that the net system is bounded, the unobservable subnet is acyclic, and the cost of each unobservable transition is strictly positive. We propose the method mainly on the basis of the notions of basis marking and basis reachability graph (BRG), which is a compact representation of the reachability graph of the net system. By sacrificing extra storage space to keep the BRG and other necessary information in memory, some time-consuming computations are moved off-line. This makes our proposed approach more feasible for on-line applications. Finally, we present a brief survey and comparison of some representative methods that use labeled Petri nets as a formalism in the literature. INDEX TERMS Basis reachability graph (BRG), discrete event system (DES), Petri net (PN), transition firing sequence.

show abstract

Fault Identification of Discrete Event Systems Modeled by Petri Nets With Unobservable Transitions

Cited by 63 publications

References 49 publications

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

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

An Efficient Deadlock Recovery Policy for Flexible Manufacturing Systems Modeled With Petri Nets

Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph

Contact Info

Product

Resources

About