The Computation of the Supremal Controllable Language for an Assembly Workstation

Abstract This paper proposes a control problem statement in the framework of supervisory control technique for the assembly workstations. A desired behaviour of an assembly workstation is analysed. The behaviour of such a workstation is cyclic and some linguistic properties are established. In this paper, it is proposed an algorithm for the computation of the supremal controllable language of the closed system desired language

[1]  V. Minzu,et al.  Approche systématique de structuration en postes des systèmes d'assemblage monoproduits , 1997 .

[2]  Viorel Mînzu,et al.  Systematic method for the design of flexible assembly systems , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[3]  P. Ramadge,et al.  Supervisory control of a class of discrete event processes , 1987 .

[4]  P. Ramadge,et al.  On the supermal controllable sublanguage of a given language , 1987 .

[5]  Shigeru Okuma,et al.  On algebraic and graph structural properties of assembly Petri net , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[6]  Shigeru Okuma,et al.  Supervisory control of assembly Petri net , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  W. M. Wonham,et al.  The control of discrete event systems , 1989 .

[8]  V. Minzu,et al.  Supervisory control technique for assembly workstation , 1999, Proceedings of the 1999 IEEE International Symposium on Assembly and Task Planning (ISATP'99) (Cat. No.99TH8470).