SciELO - Scientific Electronic Library Online

 
vol.30 número1A review of manufacturing resources planning models under different uncertainties: State-of-the-art and future directions índice de autoresíndice de materiabúsqueda de artículos
Home Pagelista alfabética de revistas  

Servicios Personalizados

Articulo

Indicadores

Links relacionados

  • En proceso de indezaciónCitado por Google
  • En proceso de indezaciónSimilares en Google

Compartir


South African Journal of Industrial Engineering

versión On-line ISSN 2224-7890
versión impresa ISSN 1012-277X

Resumen

KAID, H. et al. Design and implementation of deadlock control for automated manufacturing systems. S. Afr. J. Ind. Eng. [online]. 2019, vol.30, n.1, pp.1-23. ISSN 2224-7890.  http://dx.doi.org/10.7166/30-1-1849.

Petri nets are robust mathematical tools for the modelling, handling, and control of deadlock problems in automated manufacturing systems (AMSs). Several methods have been proposed to prevent deadlocks in AMSs. However, it is important to convert the controlled system represented by Petri nets into the program of a programmable logic controller (PLC) for the implementation of automation tasks. This study proposes a methodology based on Petri nets for deadlock prevention, and generates PLC codes for an AMS. In the suggested methodology, a Petri net model of an uncontrolled system is built, and the controlled Petri net model is developed using a deadlock-prevention method. The controlled Petri net model is then transformed into an automation-controlled Petri net model, which is further converted into a controlled token-passing logic model. The controlled token-passing logic model is utilised to generate the ladder diagrams for the AMS under consideration. The proposed methodology was tested using a real-world AMS at King Saud University labs. It provides an effective method for PLC implementation from a controlled system model represented by Petri nets.

        · resumen en Africano     · texto en Inglés     · Inglés ( pdf )

 

Creative Commons License Todo el contenido de esta revista, excepto dónde está identificado, está bajo una Licencia Creative Commons