Theory of Regions for Control Synthesis without Computing Reachability Graph

Rezig, Sadok; Achour, Zied; Rezg, Nidhal

doi:10.3390/app7030270

Cited by 4 publications

(3 citation statements)

References 29 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The importance of considering production management components linked to manufacturing execution systems (MES) has hugely increased during the last years. The Figure 1 [8] illustrates the MES growth between 2006 and 2016. In literature, many proposals deal with manufacturing system allocation and production planning.…”

Section: Introductionmentioning

confidence: 99%

Mathematical Model for Production Plan Optimization—A Case Study of Discrete Event Systems

et al. 2020

Self Cite

View full text Add to dashboard Cite

This paper proposes an optimal scheduling model under production and maintenance constraints for a real case of a discrete event system. The intent was to use the rich mathematical theory and algorithms of optimization in the study of this important class of systems. The current study detailed firstly a new approach for mapping a simulation event relationship graph into a mixed-integer program, with a flexible workshop real case. Several other potential applications of the mathematical model are examined, thanks to the model constraints flexibility characteristics, including a general case of a manufacturing system for optimal resource scheduling, an application on the case of hospital beds’ management. The model extension could be also interesting for other applications like museum systems or the case of big data in complex and social networks.

show abstract

Section: Introductionmentioning

confidence: 99%

Mathematical Model for Production Plan Optimization—A Case Study of Discrete Event Systems

et al. 2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…In our previous works [25][26][27][28][29], a new method called minimal cuts in RG was developed. Through this control policy, the computational cost of the PN supervisor was minimized by applying the TR on specific zones and not on the whole graph.…”

Section: Introductionmentioning

confidence: 99%

Compute Optimization of Petri Net Controllers Using the Algebraic Method

2019

Self Cite

View full text Add to dashboard Cite

This study attempted to calculate an optimal Petri net supervisor able to respect the control specifications imposed for a flexible manufacturing system. There are several theories around the control synthesis of discrete event systems. Unfortunately, these methods are very sensitive to the combinatorial explosion of states in the generated graph, especially when the complexity of the system increases. It is therefore necessary to move towards new ways based on formal methods allowing the synthesis of a supervisor. In this work, we propose an algebraic approach using the theory of regions. Our main contribution is to design a set of Petri net controllers based on the properties of Petri nets and not on reachability graph generation for bounded Petri nets. This will decrease significantly the production cost of the manufacturing system, since the computation burden of the supervisor is reduced. Our control policy was applied to a flexible manufacturing system implemented in our laboratory. Comparisons with previous studies using CPLEX software are provided in order to illustrate the effectiveness of our proposed method.

show abstract

“…With the increasing of graph data, graphs have been of extensive concern and deeply studied. The management and mining of graph data can effectively solve the analysis and processing problems of topological data [7][8][9]. One of the most important tasks in graph management is how to effectively answer the various queries in graph databases.…”

Section: Introductionmentioning

confidence: 99%

On Minimal Unique Induced Subgraph Queries

Jiang

Zhao

et al. 2018

Applied Sciences

View full text Add to dashboard Cite

In this paper, a novel type of interesting subgraph query is proposed: Minimal Unique Induced Subgraph (MUIS) query. Given a (large) graph G and a query vertex (position) q in the graph, can we find an induced subgraph containing q with the minimal number of vertices that is unique in G? MUIS query has many potential applications, such as subgraph retrieval, graph visualization, representative subgraph discovery and vertex property exploration. The formal definition of MUIS is given and the properties are discussed in this paper. The baseline and EQA (Efficient Query Answering) algorithms are proposed to solve the MUIS query problem under the filtering-validation framework. In the EQA algorithm, the Breadth First Search (BFS)-based candidate set generation strategy is proposed to ensure the minimality property of MUIS; the matched vertices-based pruning strategy is proposed to prune useless candidate sets and the unnecessary subgraph isomorphism; and the query position-based subgraph isomorphism is proposed to check efficiently the uniqueness of the subgraphs. Experiments are carried on real datasets and synthetic datasets to verify the effectiveness and efficiency of the proposed algorithm under novel measurements. The influencing factors of the process speed are discussed at last in the paper.

show abstract

Theory of Regions for Control Synthesis without Computing Reachability Graph

Cited by 4 publications

References 29 publications

Mathematical Model for Production Plan Optimization—A Case Study of Discrete Event Systems

Mathematical Model for Production Plan Optimization—A Case Study of Discrete Event Systems

Compute Optimization of Petri Net Controllers Using the Algebraic Method

On Minimal Unique Induced Subgraph Queries

Contact Info

Product

Resources

About