Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.0
2.3
Journals
Mathematics
Special Issues
Systems Engineering, Control, and Automation, 2nd Edition
share announcement

Systems Engineering, Control, and Automation, 2nd Edition

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E2: Control Theory and Mechanics".

Deadline for manuscript submissions: 10 June 2025 | Viewed by 6222

Special Issue Editors

Prof. Dr. Zhiwu Li

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
Prof. Dr. Kamel Barkaoui

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

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • e-Book format: Special Issues with more than 10 articles can be published as dedicated e-books, ensuring wide and rapid dissemination.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (5 papers)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

18 pages, 687 KiB  
Article
Control Law for Two-Process Flexible Manufacturing Systems Modeled Using Petri Nets
by Yang Yang, Junjun Yang, Na Liang and Chunfu Zhong
Mathematics 2025, 13(4), 611; https://doi.org/10.3390/math13040611 - 13 Feb 2025
Viewed by 469
Abstract
The deadlock control problem in flexible manufacturing systems (FMSs) has received much attention in recent years. The formalism of the Petri net is employed to effectively model, analyze, and control deadlocks in an FMS case study. There are many kinds of deadlock prevention [...] Read more.
The deadlock control problem in flexible manufacturing systems (FMSs) has received much attention in recent years. The formalism of the Petri net is employed to effectively model, analyze, and control deadlocks in an FMS case study. There are many kinds of deadlock prevention strategies based on the Petri net approach, where computational complexity is a major problem that needs to be considered. Based on the Petri net theory, this paper focuses on the two special subclasses in the S3PR net, namely the dual-process S3PR and the dual-process US3PR, in a bid to prevent deadlocks in an FMS. The relationship between the net structural characteristics and the deadlocks reached was analyzed, and then a regular method of adding controllers for these two models was proposed to reduce computational complexity. Full article
(This article belongs to the Special Issue Systems Engineering, Control, and Automation, 2nd Edition)
►▼ Show Figures

Figure 1

19 pages, 337 KiB  
Article
Study on Single-Machine Common/Slack Due-Window Assignment Scheduling with Delivery Times, Variable Processing Times and Outsourcing
by Bing Bai, Cai-Min Wei, Hong-Yu He and Ji-Bo Wang
Mathematics 2024, 12(18), 2883; https://doi.org/10.3390/math12182883 - 15 Sep 2024
Cited by 5 | Viewed by 990
Abstract
Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and its resource allocation. Currently, there are multiple [...] Read more.
Single-machine due-window assignment scheduling with delivery times and variable processing times is investigated, where the variable processing time of a job means that the processing time is a function of its position in a sequence and its resource allocation. Currently, there are multiple optimization objectives for the due-window assignment problem, and there is a small amount of research on optimization problems where the window starting time, the rejected cost and the optimal scheduling are jointly required. The goal of this paper is to minimize the weighed sum of scheduling cost, resource consumption cost and outsourcing measure under the optional job outsourcing (rejection). Under two resource allocation models (i.e., linear and convex resource allocation models), the scheduling cost is the weighted sum of the number of early–tardy jobs, earliness–tardiness penalties and due-window starting time and size, where the weights are positional-dependent. The main contributions of this paper include the study and data simulation of single-machine scheduling with learning effects, delivery times and outsourcing cost. For the weighed sum of scheduling cost, resource consumption cost and outsourcing measure, we prove the polynomial solvability of the problem. Under the common and slack due-window assignments, through the theoretical analysis of the optimal solution, we reveal that four problems can be solved in O(n6) time, where n is the number of jobs. Full article
(This article belongs to the Special Issue Systems Engineering, Control, and Automation, 2nd Edition)
►▼ Show Figures

Figure 1

20 pages, 487 KiB  
Article
A Set Covering Approach to Design Maximally Permissive Supervisors for Flexible Manufacturing Systems
by Yongyao Li, Yufeng Chen and Rui Zhou
Mathematics 2024, 12(11), 1687; https://doi.org/10.3390/math12111687 - 29 May 2024
Cited by 1 | Viewed by 1011
Abstract
The supervisory control of Petri nets aims to enforce the undesired behavior as unreachable by designing a set of control places. This work presents a set cover approach to design maximally permissive supervisors. For each first-met bad marking, an integer linear programming problem [...] Read more.
The supervisory control of Petri nets aims to enforce the undesired behavior as unreachable by designing a set of control places. This work presents a set cover approach to design maximally permissive supervisors. For each first-met bad marking, an integer linear programming problem is developed to obtain a control place to prohibit it. An objective function is formulated to make the maximal number of first-met bad markings forbidden. Then, we develop a set covering approach to minimize the number of selected control places. The proposed approach can guarantee the maximal permissiveness of the obtained supervisor and provide a trade-off between structural complexity and computational cost. Several examples are considered to validate the proposed method. Full article
(This article belongs to the Special Issue Systems Engineering, Control, and Automation, 2nd Edition)
►▼ Show Figures

Figure 1

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
Cited by 2 | Viewed by 1435
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 5 | Viewed by 1413
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

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-5
Back to TopTop