Control Synthesis Based On Theory of Regions with Minimal Reachability Graph Knowledge

Rezig, Sadok; Achour, Zied; Rezg, Nidhal

doi:10.1016/j.ifacol.2016.07.759

Cited by 5 publications

(8 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Canonic markings method [24]: From the GMEC, one can synthesize the forbidden state that does not satisfy the control specification. However, by performing back chaining CH b , one can find the initial marking M 0 :…”

Section: Mtsi Conditionsmentioning

confidence: 99%

See 1 more Smart Citation

Theory of Regions for Control Synthesis without Computing Reachability Graph

2017

View full text Add to dashboard Cite

This paper addresses the design of Petri net (PN) supervisor using the theory of regions for forbidden state problem with a set of general mutual exclusion constraints. In fact, as any method of supervisory control based on reachability graph, the theory of regions suffers from a technical obstacle in control synthesis, which is the necessity of computing the graph at each iteration step. Moreover, based on the reachability graph, which may contain a large number of states, with respect to the structural size of the system, the computation of PN controllers becomes harder and even impossible. The main contribution of this paper, compared to previous works, is the development of a control synthesis method in order to decrease significantly the computation cost of the PN supervisor. Thus, based on PN properties and mathematical concepts, the proposed methodology provides an optimal PN supervisor for bounded Petri nets following the interpretation of the theory of regions. Finally, case studies are solved by CPLEX software to compare our new control policy with previous works which use the theory of regions for control synthesis.

show abstract

Section: Mtsi Conditionsmentioning

confidence: 99%

“…In our previous works [21][22][23][24][25], a new method of minimal cuts in RG is developed using the theory of regions. Through this approach, we have also minimized the computational cost of PN supervisor using the TR on specific areas of the graph and not on the whole RG.…”

Section: Introductionmentioning

confidence: 99%

Theory of Regions for Control Synthesis without Computing Reachability Graph

2017

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%

“…Section 4 presents the petri net of our flexible manufacturing system example, on which we will apply our method. In Section 5, the comparison results with previous works on supervisory control are provided [13,22,28,29]. Finally, conclusions and perspectives are drawn in Section 5.…”

Section: Introductionmentioning

confidence: 99%

Compute Optimization of Petri Net Controllers Using the Algebraic Method

2019

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

Control Synthesis Based On Theory of Regions with Minimal Reachability Graph Knowledge

Cited by 5 publications

References 12 publications

Theory of Regions for Control Synthesis without Computing Reachability Graph

Theory of Regions for Control Synthesis without Computing Reachability Graph

Compute Optimization of Petri Net Controllers Using the Algebraic Method

On Minimal Unique Induced Subgraph Queries

Contact Info

Product

Resources

About