Identification and elimination of redundant control places in petri net based liveness enforcing supervisors of FMS

Uzam, Murat; Li, Zhiwu; Zhou, MengChu

doi:10.1007/s00170-006-0701-5

Cited by 95 publications

(58 citation statements)

References 31 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Moreover, the redundancy test of all computed monitors is carried out by utilizing the method in Uzam et al 56 It can be verified that V 1 , V 2 , . .…”

Section: Subnetmentioning

confidence: 99%

Near-optimal supervisory control of flexible manufacturing systems using divide-and-conquer iterative method

Zhao

Uzam

Hou

2016

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

This article proposes an iterative deadlock resolution method for flexible manufacturing systems modeled with G-systems. To design a non-blocking controlled system with maximally permissive behavior in a G-system (GS), a reachability graph-based analysis technology is utilized. Since the reachability graph of a large-scale GS easily becomes unmanageable, an optimal non-blocking supervisor becomes a challenging problem in a GS. To facilitate this problem, the Divide-andConquer approach is a good choice for complex G-systems. First, an uncontrolled GS resolves into a number of associated subnets. Then, every subnet suffering from deadlocks is utilized to design the liveness-enforcing supervisor for the original GS. Thus, additional monitors can be obtained if the liveness of all subnets is achieved. Subsequently, a partially controlled GS is derived by including all monitors within the GS, and its liveness can be ensured by designing a new set of monitors. Consequently, a non-blocking GS is derived. The major advantage of the proposed method is that a nonblocking supervisor with near-optimal behavioral permissiveness can be obtained in general. Finally, a typical GS example popularly studied in the literature is applied to demonstrate the validity and the availability of the method in this article.

show abstract

“…Moreover, the redundancy test of all computed monitors is carried out by utilizing the method in Uzam et al 56 It can be verified that V 1 , V 2 , . .…”

Section: Subnetmentioning

confidence: 99%

Near-optimal supervisory control of flexible manufacturing systems using divide-and-conquer iterative method

Zhao

Uzam

Hou

2016

Advances in Mechanical Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…The only possible sets of marked operation places for the unmarked S 10 are Ψ 1 ¼ p 3 ; f p 4 ; p 5 ; p 9 ; p 10 g & S 10 ½ , Ψ 2 ¼ p 3 ; p 4 ; p 6 ; p 9 ; p 10 f g & S 10 ½ , Ψ 3 ¼ p 2 ; p 3 ; p 6 ; p 9 ; p 10 f g & S 10 ½ , and Ψ 4 ¼ p 2 ; p 4 ; p 6 ; f p 9 ; p 10 g & S 10 ½ with markings M Ψ1 ¼ p 3 þ p 4 þ p 5 þ p 9 þ p 10 , M Ψ2 ¼ p 3 þ p 4 þ p 6 þ p 9 þ p 10 , M Ψ3 ¼ p 2 þ p 3 þ p 6 þ p 9 þ p 10 , and M Ψ4 ¼ p 2 þ p 4 þ p 6 þ p 9 þ p 10 , respectively; the number of tokens in Ψ 1 or Ψ 2 or Ψ 3 is five.…”

Section: Theorymentioning

confidence: 99%

“…Consequently, deadlocks occur due to processes holding resources mutually waiting for others to release their resources. Deadlock prevention [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16] adds monitors to problematic siphons to prevent them from becoming insufficiently marked.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Comments on “enhancement of an efficient liveness-enforcing supervisor for flexible manufacture systems”

Chao¹

2011

Int J Adv Manuf Technol

View full text Add to dashboard Cite

Region theory can synthesize maximally permissive supervisors by solving a set of inequalities based on the marking/transition-separation instances (MTSIs). It is infeasible to solve these inequalities for either a sizable net or a small net with a sizable initial marking. Huang et al. [1] propose novel crucial MTSIs to reduce the number of MTSIs. Experimental results show that the proposed control policy is the most efficient algorithm among the closely related approaches. One example shows that it not only reaches all live states but also employs fewer control arcs than that by Li et al. Huang et al. offer no hints on why it employs fewer control arcs. This paper develops theory to explain the physics behind.

show abstract

“…For Petri nets, as a basis for activity diagrams, the elimination of redundant control places while keeping a Petri net live is described by Uzam et al [25]. In addition to presenting an approach to detect clones in models, Störrle gives an example of a transformation that removes recurring fragments of activities by factoring them into independent activities [13].…”

Section: Related Workmentioning

confidence: 99%

Removal of Redundant Elements within UML Activity Diagrams

Beckmann

Michalke

Schlutter

et al. 2017

2017 ACM/IEEE 20th International Conference on Model Driven Engineering Languages and Systems (MODELS)

View full text Add to dashboard Cite

Abstract-As the complexity of systems continues to rise, the use of model-driven development approaches becomes more widely applied. Still, many created models are mainly used for documentation. As such, they are not designed to be used in following stages of development, but merely as a means of improved overview and communication. In an effort to use existing UML2 activity diagrams of an industry partner (Daimler AG) as a source for automatic generation of software artifacts, we discovered, that the diagrams often contain multiple instances of the same element. These redundant instances might improve the readability of a diagram. However, they complicate further approaches such as automated model analysis or traceability to other artifacts because mostly redundant instances must be handled as one distinctive element. In this paper, we present an approach to automatically remove redundant ExecutableNodes within activity diagrams as they are used by our industry partner. The removal is implemented by merging the redundant instances to a single element and adding additional elements to maintain the original behavior of the activity. We use reachability graphs to argue that our approach preserves the behavior of the activity. Additionally, we applied the approach to a real system described by 36 activity diagrams. As a result 25 redundant instances were removed from 15 affected diagrams.

show abstract

Identification and elimination of redundant control places in petri net based liveness enforcing supervisors of FMS

Cited by 95 publications

References 31 publications

Near-optimal supervisory control of flexible manufacturing systems using divide-and-conquer iterative method

Near-optimal supervisory control of flexible manufacturing systems using divide-and-conquer iterative method

Comments on “enhancement of an efficient liveness-enforcing supervisor for flexible manufacture systems”

Removal of Redundant Elements within UML Activity Diagrams

Contact Info

Product

Resources

About