Systems Engineering, Control, and Automation, 2nd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Engineering Mathematics".

Deadline for manuscript submissions: 31 August 2024 | Viewed by 1840

Special Issue Editors


E-Mail Website
Guest Editor
Institute of Systems Engineering, Macau University of Science and Technology, Taipa, Macao
Interests: discrete event system; petri net theory and application; control and scheduling of production systems; data mining and granular computing
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Computer Science Department, Conservatoire National des Arts et Métiers, 75141 Paris, France
Interests: formal methods for specification; verification, control and performance evaluation of concurrent and discrete-event systems
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

Control and automation are ubiquitous in a wide spectrum of contemporary computer-integrated systems that serve as the developmental basis of human society. Over the past decades, there has been a boom in novel methodologies and unprecedented challenges for various control and automation systems, due to their diversity. As a universal modeling and analysis tool, mathematics consistently provides support for the development of such systems. In recent years, the role of artificial intelligence and network technology in systems engineering, control and automation has also been witnessed. This Special Issue aims to collect the recent advances in this research area, with a particular focus on, but not limited to, the following topics:  

  • Systems engineering in economy and society;
  • Scheduling and control of production system;
  • Discrete event system;
  • Artificial intelligence in control and automation;
  • Petri nets in automation and control engineering;
  • Intelligent scheduling;
  • Advanced mathematics methods in automation;
  • Industrial automation and robotic process control;
  • Intelligent systems (fuzzy control, artificial neural networks and genetic algorithms);
  • Computer-based real-time control system;
  • Networked control system;
  • Cyber-physcial system.

Prof. Dr. Zhiwu Li
Prof. Dr. Kamel Barkaoui
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • systems control and automation
  • scheduling and planning
  • automated production system
  • intelligent system systems science and engineering

Published Papers (2 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

12 pages, 552 KiB  
Article
Polynomial-Time Verification of Decentralized Fault Pattern Diagnosability for Discrete-Event Systems
by Ye Liang, Gaiyun Liu and Ahmed M. El-Sherbeeny
Mathematics 2023, 11(18), 3998; https://doi.org/10.3390/math11183998 - 20 Sep 2023
Viewed by 775
Abstract
This paper considers the verification of decentralized fault pattern diagnosability for discrete event systems, where the pattern is modeled as a finite automaton whose accepted language is the objective to be diagnosed. We introduce a notion of codiagnosability to formalize the decentralized fault [...] Read more.
This paper considers the verification of decentralized fault pattern diagnosability for discrete event systems, where the pattern is modeled as a finite automaton whose accepted language is the objective to be diagnosed. We introduce a notion of codiagnosability to formalize the decentralized fault pattern diagnosability, which requires the pattern to be detected by one of the external local observers within a bounded delay. To this end, a structure, namely a verifier, is proposed to verify the codiagnosability of the system and the fault pattern. By studying an indeterminate cycle of the verifier, sufficient and necessary conditions are provided to test the codiagnosability. It is shown that the proposed method requires polynomial time at most. In addition, we present an approach to extend the proposed verifier structure so that it can be applied to centralized cases. Full article
(This article belongs to the Special Issue Systems Engineering, Control, and Automation, 2nd Edition)
Show Figures

Figure 1

28 pages, 497 KiB  
Article
Detectability in Discrete Event Systems Using Unbounded Petri Nets
by Haoming Zhu, Gaiyun Liu, Zhenhua Yu and Zhiwu Li
Mathematics 2023, 11(18), 3862; https://doi.org/10.3390/math11183862 - 10 Sep 2023
Cited by 1 | Viewed by 672
Abstract
This paper investigated the verification of detectability for discrete event systems based on a class of partially observed unbounded Petri nets. In an unbounded net system, all transitions and partial places are assumed to be unobservable. The system administrator can only observe a [...] Read more.
This paper investigated the verification of detectability for discrete event systems based on a class of partially observed unbounded Petri nets. In an unbounded net system, all transitions and partial places are assumed to be unobservable. The system administrator can only observe a few observable places, i.e., the number of tokens at these places can be observed, allowing for the estimation of current and subsequent states. The concepts of quasi-observable transitions, truly unobservable transitions, and partial markings are used to construct a basis coverability graph. According to this graph, four sufficient and necessary conditions of detectability are proposed. Correspondingly, a specific example is proposed to prove that the detectability can be verified in the unbounded net system. Furthermore, based on the conclusion of detectability, the system’s ability to detect critical states was explored by using the basis coverability graph, called C-detectability. Two real-world examples are proposed to show that the detectability of discrete event systems has not only pioneered new research methods, but also demonstrated that the real conditions faced by this method are more general, and it has overcome the limitations of relying only on the ideal conditions of bounded systems for verification. Full article
(This article belongs to the Special Issue Systems Engineering, Control, and Automation, 2nd Edition)
Show Figures

Figure 1

Back to TopTop